#include <bits/stdc++.h>
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll gcd(ll n, ll m) {
  ll tmp;
  while (m != 0) {
    tmp = n % m;
    n = m;
    m = tmp;
  }
  return n;
}
ll lcm(ll n, ll m) { return abs(n) / gcd(n, m) * abs(m); }
using namespace std;
void solve() {
  int t;
  cin >> t;
  while (t--) {
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    if (a < b) {
      cout << "No\n";
    } else if (b > d) {
      cout << "No\n";
    } else if ((c + 1) >= b) {
      cout << "Yes\n";
    } else {
      bool ng = false;
      ll x = gcd(b, d);
      for (ll i = a / x - 1; i <= a / x + 100000; ++i) {
        if (a - x * i < 0) {
          if (a - x * i > c) {
            ng = true;
            break;
          }
        }
      }
      if (ng) {
        cout << "No\n";
      } else {
        cout << "Yes\n";
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
