An ant's story

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

Description

Long long ago, there is an ant crawling on an L-meter magic rubber band with speed of v cm/s.The magic rubber band will elongate m meters every second. We can assume that the magic rubber band elongates equably. Now, the ant is on the start point and crawling to another point, please tell me whether it can reach the endpoint.

Input

The first line of the input is T, which stands for the number of test cases you need to solve.
Each case include three integers: L , v , m ( 0< L< 10^9,0<= v, m< 10^ 9,).

Output

For each test case, if the ant can reach endpoint, output "YES", otherwise "NO".

Sample Input

1 99999 61 1

Sample Output

YES

Hint

lcy

Source

HDU2010省赛集训队选拔赛(校内赛)

提交代码