Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

No tag edit access

E. Doodle Jump

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn Doodle Jump the aim is to guide a four-legged creature called "The Doodler" up a never-ending series of platforms without falling. — Wikipedia.

It is a very popular game and xiaodao likes it very much. One day when playing the game she wondered whether there exists a platform that the doodler couldn't reach due to the limits of its jumping ability. Consider the following problem.

There are *n* platforms. The height of the *x*-th (1 ≤ *x* ≤ *n*) platform is *a*·*x* mod *p*, where *a* and *p* are positive co-prime integers. The maximum possible height of a Doodler's jump is *h*. That is, it can jump from height *h*_{1} to height *h*_{2} (*h*_{1} < *h*_{2}) if *h*_{2} - *h*_{1} ≤ *h*. Initially, the Doodler is on the ground, the height of which is 0. The question is whether it can reach the highest platform or not.

For example, when *a* = 7, *n* = 4, *p* = 12, *h* = 2, the heights of the platforms are 7, 2, 9, 4 as in the picture below. With the first jump the Doodler can jump to the platform at height 2, with the second one the Doodler can jump to the platform at height 4, but then it can't jump to any of the higher platforms. So, it can't reach the highest platform.

User xiaodao thought about the problem for a long time but didn't solve it, so she asks you for help. Also, she has a lot of instances of the problem. Your task is solve all of these instances.

Input

The first line contains an integer *t* (1 ≤ *t* ≤ 10^{4}) — the number of problem instances. Each of the next *t* lines contains four integers *a*, *n*, *p* and *h* (1 ≤ *a* ≤ 10^{9}, 1 ≤ *n* < *p* ≤ 10^{9}, 0 ≤ *h* ≤ 10^{9}). It's guaranteed that *a* and *p* are co-prime.

Output

For each problem instance, if the Doodler can reach the highest platform, output "YES", otherwise output "NO".

Examples

Input

3

7 4 12 2

7 1 9 4

7 4 12 3

Output

NO

NO

YES

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/22/2019 05:31:02 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|