Payment Without Change

You have aa coins of value nn and bb coins of value 11. You always pay in exact change, so you want to know if there exist such xx and yy that if you take xx (0≤x≤a0≤x≤a) coins of value nn and yy (0≤y≤b0≤y≤b) coins of value 11, then the total value of taken coins will be SS.

You have to answer qq independent test cases.

 

 

Input

 

The first line of the input contains one integer qq (1≤q≤1041≤q≤104) — the number of test cases. Then qq test cases follow.

The only line of the test case contains four integers aa, bb, nn and SS (1≤a,b,n,S≤1091≤a,b,n,S≤109) — the number of coins of value nn, the number of coins of value 11, the value nn and the required total value.

 

 

Output

 

For the ii-th test case print the answer on it — YES (without quotes) if there exist such xx and yy that if you take xx coins of value nn and yy coins of value 11, then the total value of taken coins will be SS, 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

#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;
long long a,b,n,s;
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%164d %164d %164d %164d",&a,&b,&n,&s);
		if(s<n){
			if(b<s){
				printf("NO\n");
			}else{
				printf("YES\n");
			}
		}else if(s==n){
			printf("YES\n");
		}else{
			if(s%n==0 && a*n>=s){
				printf("YES\n");
			}else if(s%n==0 && a*n<s){
				s=s-(a*n);
				if(s>b){
					printf("NO\n");
				}else{
					printf("YES\n");
				}
			}else{
				int t=s/n;
				if(t<=a){
					int t1=s-t*n;
					if(t1<=b)
						printf("YES\n");
					else
						printf("NO\n");
				}else{
					int t1=s-a*n;
					if(t1<=b)
						printf("YES\n");
					else
						printf("NO\n");
				}
			}
		}
	}
	return 0;
}