#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV int(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
//const double PI = M_PI;  
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

/*Coding Space*/

int main(){
  int t; cin >> t;
  rep(iii,t){
    ll a,b,c,d; cin >> a >> b >> c >> d;
    if(a < b || d < b){
      cout << "No" << endl;
      continue;
    }else{
        set<ll> used;
        bool flag = 0;
        int cnt = 0;
        while(used.count(a) == 0){
        used.insert(a);
        ll n = (a-c+b-1)/b;
        //SHOW(a,n);
        ++cnt;
        if(a-(n-1)*b < b) {cout << "No" << endl; flag++; break;}
        if(cnt > 10000)  break;
        a = a-n*b + d;
      }
      if(!flag) cout << "Yes" << endl;
    }
  }
}