#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const ll inf = (1e18);
const ll mod = 1000000007;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll c, ll d) { return c / GCD(c, d) * d; }
struct __INIT {
  __INIT() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} __init;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
void solve() {
  ll a, b, c, d;
  cin >> a >> b >> c >> d;
  if (a < b) {
    cout << "No"
         << "\n";
    return;
  }
  if (c >= b && d >= b) {
    cout << "Yes"
         << "\n";
    return;
  }
  if (d < b) {
    cout << "No"
         << "\n";
    return;
  }
  if (c + 1 == b) {
    cout << "Yes"
         << "\n";
    return;
  }
  if ((a - c) % b != 0 && (a - c) % b + c < b) {
    cout << "No"
         << "\n";
    return;
  }
  if (d % b == 0) {
    cout << "Yes"
         << "\n";
    return;
  }
  ll e = (a - c);
  if (e % d == 0 || d % e == 0)
    cout << "Yes"
         << "\n";
  else
    cout << "No"
         << "\n";
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
