Problem
Chef is playing Need For Speed. Currently, his car is running on a straight road with a velocity
metres per second and approaching a turn which is metres away from him. To successfully cross the turn, velocity of the car when entering the turn must not exceed metres per second.
The brakes of Chef's car allow him to slow down with a deceleration (negative acceleration) not exceeding metres per squared second. Tell him whether he can cross the turn successfully. The velocity when entering the turn can be determined from Newton's 2nd law to be if the car is moving with a uniform acceleration .
Input
- The first line of the input contains a single integer denoting the number of test cases. The description of test cases follows.
- The first and only line of each test case contains four space-separated integers , , and .
Output
For each test case, print a single line containing the string "Yes"
if Chef can cross the turn successfully or "No"
if he cannot (without quotes).
You may print each character of each string in uppercase or lowercase (for example, the strings "yEs", "yes", "Yes" and "YES" will all be treated as identical).
Constraints
Subtasks
Subtask #1 (100 points): original constraints
Sample 1:
3
1 1 1 1
2 1 1 1
2 2 1 1
Yes
No
Yes
Explanation:
Example case 1: Since , Chef does not need to brake and will be able to turn successfully.
Example case 2: The smallest velocity Chef's car can have even with the maximum deceleration is , which is greater than the maximum allowed velocity for a safe turn.
Example case 3: The smallest velocity Chef's car can have with the maximum deceleration is again , which is smaller than the maximum allowed velocity for a safe turn.
ANSWER