#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
struct multi {
  ll first;
  ll second;
  ll third;
  multi(ll first, ll second, ll third)
      : first(first), second(second), third(third) {}
};
bool multicomp(const multi &a, const multi &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}
ll GCD(ll a, ll b) {
  if (b == 0)
    return a;
  return GCD(b, a % b);
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll T;
  cin >> T;
  vl A(T), B(T), C(T), D(T);
  REP(i, T) cin >> A[i] >> B[i] >> C[i] >> D[i];

  REP(i, T) {
    if (A[i] < B[i]) {
      cout << "No" << endl;
      continue;
    } else if (D[i] < B[i]) {
      cout << "No" << endl;
      continue;
    } else if (C[i] >= B[i]) {
      cout << "Yes" << endl;
      continue;
    }
    ll po = ceil(((long double)A[i] - (long double)C[i]) / (long double)B[i]) *
            B[i];
    if (po > A[i]) {
      cout << "No" << endl;
      continue;
    }
    po = A[i] - po;
    ll yo = ceil(((long double)D[i] - (long double)C[i] + (long double)po) /
                 (long double)B[i]) *
            B[i];
    if (yo > po + D[i]) {
      cout << "No" << endl;
      continue;
    }
    if (D[i] % B[i] == 0) {
      cout << "Yes" << endl;
      continue;
    }
    po = po + D[i] - yo;
    // cout <<((((C[i] - (po % B[i])) / (D[i] % B[i])) + 1) * (D[i] % B[i]))  <<
    // "," << i << endl;
    ll g = GCD(B[i], D[i]);
    if (B[i] - g + (A[i] % g) > C[i])
      cout << "No" << endl;
    else
      cout << "Yes" << endl;
  }

  return 0;
}


Measured memory_bytes: 256