Problem: Ringo Mart, a convenience store, sells apple juice.

On the opening day of Ringo Mart, there were A cans of juice in stock in the morning. Snuke buys B cans of juice here every day in the daytime. Then, the manager checks the number of cans of juice remaining in stock every night. If there are C or less cans, D new cans will be added to the stock by the next morning.

Determine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them. Nobody besides Snuke buy juice at this store.

Note that each test case in this problem consists of T queries.

Constraints

* 1 \leq T \leq 300
* 1 \leq A, B, C, D \leq 10^{18}
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


T
A_1 B_1 C_1 D_1
A_2 B_2 C_2 D_2
:
A_T B_T C_T D_T


In the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.

Output

Print T lines. The i-th line should contain `Yes` if Snuke can buy apple juice indefinitely in the i-th query; `No` otherwise.

Examples

Input

14
9 7 5 9
9 7 6 9
14 10 7 12
14 10 8 12
14 10 9 12
14 10 7 11
14 10 8 11
14 10 9 11
9 10 5 10
10 10 5 10
11 10 5 10
16 10 5 10
1000000000000000000 17 14 999999999999999985
1000000000000000000 17 15 999999999999999985


Output

No
Yes
No
Yes
Yes
No
No
Yes
No
Yes
Yes
No
No
Yes


Input

24
1 2 3 4
1 2 4 3
1 3 2 4
1 3 4 2
1 4 2 3
1 4 3 2
2 1 3 4
2 1 4 3
2 3 1 4
2 3 4 1
2 4 1 3
2 4 3 1
3 1 2 4
3 1 4 2
3 2 1 4
3 2 4 1
3 4 1 2
3 4 2 1
4 1 2 3
4 1 3 2
4 2 1 3
4 2 3 1
4 3 1 2
4 3 2 1


Output

No
No
No
No
No
No
Yes
Yes
No
No
No
No
Yes
Yes
Yes
No
No
No
Yes
Yes
Yes
No
No
No

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		long a[][]=new long[t][4];

		long gcd;
		long test;
		boolean ans;

		for(int i=0; i<t;i++) {
			for(int j=0;j<4;j++) {
				a[i][j]=sc.nextLong();
			}
		}
		for(int i=0;i<t;i++) {
			if(a[i][0]<a[i][1]||a[i][1]>a[i][3]) {
				ans=false;
			}
			else if(mod(a[i][3], a[i][1])==0) {
				test=mod(a[i][0], a[i][1]);
				ans=true;
				if(test>a[i][2]) {
					ans=false;
				}
			}
			else {
				a[i][0]=mod(a[i][0], a[i][1]);
				a[i][3]=mod(a[i][3], a[i][1]);

				ans=true;
				gcd=saidaikouyakusuu(a[i][3], a[i][1]);
				test=mod(a[i][1], gcd)-gcd;
				if(a[i][1]+test>a[i][2]) {
					ans=false;
				}

				/*
				test=0;
				ans=true;
				do{
					test=mod(test+gcd, a[i][1]);
					if(test<a[i][1]&&test>a[i][2]) {
						ans=false;
					}
				} while(test!=0);*/



			}


			if(ans) {
				System.out.println("Yes");
			}
			else {
				System.out.println("No");
			}
		}

	}

	public static long mod(long a,long b) {
		return(a%b);
	}

	public static long saidaikouyakusuu(long x, long y) {
		if(x<y) {
			long swap=x;
			x=y;
			y=swap;
		}
		if(y!=0) {
			long tmp;
	        while ((tmp = x % y) != 0) {
	            x = y;
	            y = tmp;
	        }

		}
		return y;
	}

}