F. Frisbee Training
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Competitive frisbee has, for some reason, become a thing now, and everyone's trying to be the best. For this reason, Johannes and Asfora have begun practicing this sport, and their practice routine goes something like this: both of them start at the same point, and Johannes throws the frisbee in some direction while Asfora begins running after the frisbee. They're intelligent, so when the frisbee is thrown, Asfora is able to precisely pinpoint where it's going to land and begins running towards that direction.

Since they've been training a lot, Asfora has gotten lazy and will now only run if he's certain that he'll reach the frisbee. He doesn't have time to do this calculation, so he asks you for help in knowing whether he'll run or not. When Johannes throws a frisbee, Asfora is able to tell you the coordinates in which it'll land in relation to the starting point, how fast he's able to run at that moment, and how long it takes for the frisbee to reach the ground. Will you be able to help him?

Input

The first line contains a single integer $$$T$$$, $$$(1 \leq T \leq 10^5)$$$ — the number of test cases.

Each test case is one line and contains four integers, $$$x$$$, $$$y$$$, $$$v$$$, $$$t$$$, $$$(1 \leq x, y \leq 10^4)$$$, $$$(1 \leq v, t \leq 10^2)$$$ — the $$$x$$$ and $$$y$$$ position where the frisbee lands in relation to the starting point, the speed in which Asfora runs, and the amount of time it took for the frisbee to reach the ground.

Output

For each test case, output YES if he can get to the frisbee in the elapsed time, or NO otherwise.

Example
Input
2
4 2 3 10
6 8 1 9
Output
YES
NO