You have a coins of value n and b coins of value 1. You always pay in exact change, so you want to know if there exist such x and y that if you take x (0 ≤ x ≤ a) coins of value n and y (0 ≤ y ≤ b) coins of value 1, then the total value of taken coins will be S.

You have to answer q independent test cases.

Input

The first line of the input contains one integer q (1 ≤ q ≤ 10^4) — the number of test cases. Then q test cases follow.

The only line of the test case contains four integers a, b, n and S (1 ≤ a, b, n, S ≤ 10^9) — the number of coins of value n, the number of coins of value 1, the value n and the required total value.

Output

For the i-th test case print the answer on it — YES (without quotes) if there exist such x and y that if you take x coins of value n and y coins of value 1, then the total value of taken coins will be S, and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

Example

Input


4
1 2 3 4
1 2 3 6
5 2 6 27
3 3 5 18


Output


YES
NO
NO
YES
import java.util.*;import java.io.*;import java.math.*;

//=============================================================================
//--------------------------Main-Class---------------------------------
//=============================================================================

public class A {

	public static void process()throws IOException{
		
		long a = sc.nextLong(),b = sc.nextLong(),n = sc.nextLong(),s = sc.nextLong();
		long val = a;
		long extra = b/n;
		long m = s/n;
		long mod = s%n;
		if(val < m) {
			if(extra+val<m) {
				println("NO");
				return;
			}
			val = m;
			b-=(m-a)*n;
		}
		if(val >= m && b >= mod) {
			println("YES");
		}
		else {
			println("NO");
		}
		
		
    }
	

	//=============================================================================
	//--------------------------Dheeraj-Bhagchandani---------------------------------
	//=============================================================================
	
	static FastScanner sc;
    static PrintWriter out;
    public static void main(String[]args)throws IOException
    {
        boolean oj = true;
        if(oj){sc=new FastScanner();out=new PrintWriter(System.out);}
        else{sc=new FastScanner(100);out=new PrintWriter("output.txt");}
        int t=1;
        t = sc.nextInt();
        while(t-->0) {process();}
        out.flush();out.close();  
    }
    
    static class Pair implements Comparable<Pair> {
		int x, y;
		Pair(int x, int y) {
			this.x = x;
			this.y = y;
		}
		@Override
		public int compareTo(Pair o) {
			return Integer.compare(this.x, o.x);
		}
	}
    
/////////////////////////////////////////////////////////////////////////////////////////////////////////
    
	static void println(Object o){out.println(o);}
    static void print(Object o){out.print(o);}
    static void pflush(Object o){out.println(o);out.flush();}
    static int ceil(int x, int y) {return (x % y == 0 ? x / y : (x / y + 1));}
	static long ceil(long x, long y) {return (x % y == 0 ? x / y : (x / y + 1));}
	static int max(int x, int y) {return Math.max(x, y);}
	static int min(int x, int y) {return Math.min(x, y);}
	static int abs(int x) {return Math.abs(x);}
	static long abs(long x) {return Math.abs(x);}
	static int log2(int N) {int result = (int) (Math.log(N) / Math.log(2));return result;}
	static long max(long x, long y) {return Math.max(x, y);}
	static long min(long x, long y) {return Math.min(x, y);}
	public static int gcd(int a, int b) {
		BigInteger b1 = BigInteger.valueOf(a);BigInteger b2 = BigInteger.valueOf(b);
		BigInteger gcd = b1.gcd(b2);return gcd.intValue();}
	public static long gcd(long a, long b) {
		BigInteger b1 = BigInteger.valueOf(a);BigInteger b2 = BigInteger.valueOf(b);
		BigInteger gcd = b1.gcd(b2);return gcd.longValue();}
   
	
	
/////////////////////////////////////////////////////////////////////////////////////////////////////////
	
	static class FastScanner{BufferedReader br; StringTokenizer st;
	FastScanner()throws FileNotFoundException{
    br=new BufferedReader(new InputStreamReader(System.in));}
	FastScanner(int a)throws FileNotFoundException{
    br = new BufferedReader(new FileReader("input.txt"));}
    String next()throws IOException{
    while (st == null || !st.hasMoreElements()) {try{
    st = new StringTokenizer(br.readLine());}
    catch (IOException  e){ e.printStackTrace(); }}
    return st.nextToken(); } int nextInt() throws IOException{
    return Integer.parseInt(next());}
    long nextLong() throws IOException
    {return Long.parseLong(next());}
    double nextDouble()throws IOException { return Double.parseDouble(next()); }
    String nextLine() throws IOException{ String str = ""; try{
    str = br.readLine();} catch (IOException e){
    e.printStackTrace();} return str;}
     int[] readArray(int n)throws IOException{int[]A=new int[n];
    for(int i=0;i!=n;i++){A[i]=sc.nextInt();}return A;}
     long[] readArrayLong(int n)throws IOException{long[]A=new long[n];
    for(int i=0;i!=n;i++){A[i]=sc.nextLong();}return A;}}
	
	static void ruffleSort(int[] a) {Random get = new Random();
		for (int i = 0; i < a.length; i++) {int r = get.nextInt(a.length);
		int temp = a[i];a[i] = a[r];a[r] = temp;}Arrays.sort(a);}
	static void ruffleSort(long[] a) {Random get = new Random();
		for (int i = 0; i < a.length; i++) {int r = get.nextInt(a.length);
		long temp = a[i];a[i] = a[r];a[r] = temp;}Arrays.sort(a);}
}
