#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
inline ll randint(ll a, ll b) {
  ll w = (_g() << 31LL) ^ _g();
  return a + w % (b - a + 1);
}
inline void fast_io() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
};
template <typename T, typename S>
inline ostream& operator<<(ostream& os, const pair<T, S> p) {
  cout << "[" << p.first << ";" << p.second << "]";
  return os;
}
template <typename T, typename S>
inline ostream& operator<<(ostream& os, const map<T, S> p) {
  for (auto el : p) cout << "[" << el.first << ";" << el.second << "]";
  return os;
}
template <typename T>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto el : v) cout << el << " ";
  return os;
}
template <typename T>
inline vector<T> fetch_vec(int sz) {
  vector<T> ret(sz);
  for (auto& elem : ret) cin >> elem;
  return ret;
}
int T;
void input() {
  fast_io();
  cin >> T;
}
ll gcd(ll a, ll b) {
  if (a == 0)
    return b;
  else
    return gcd(b, b % a);
}
int solve() {
  vector<string> ans;
  for (int i = 0; i < T; i++) {
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    if (a < b || d < b) {
      ans.push_back("No");
      continue;
    } else if (c >= b || b == c + 1) {
      ans.push_back("Yes");
      continue;
    } else {
      a %= b;
      d %= b;
      ll g = gcd(b, d);
      ll C = a + b - g;
      if (C > c) {
        ans.push_back("No");
        continue;
      } else {
        ans.push_back("Yes");
        continue;
      }
    }
  }
  for (auto a : ans) cout << a << "\n";
  return 0;
}
int main() {
  input();
  solve();
  return 0;
}
