Codeforces Round #598 (Div. 3) B. Minimize the Permutation

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define pb push_back
#define pob pop_back
#define all(a) a.begin(),a.end()
#define fio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define i64 long long int
#define mem(x,y) memset(x,y,sizeof(x))
#define fill(arr,b) fill(arr, arr+sizeof(arr)/sizeof(arr[0]), b)
 
const double pi = acos(-1.0);
const int maxn = (i64)2e5+5;
 
int main(){
    fio;
    int a,b,n,s,q;
    cin>>q;
    while(q--){
            cin>>a>>b>>n>>s;
            int x = s/n;
            if(x>a) s = s - (a*n);
            else s = s - (x*n);
            if(s<=b) cout<<"YES"<<"\n";
            else cout<<"NO\n";
    }
return 0;
}