#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
int chk(long long A, long long B, long long C, long long D) {
  if (A < B || A < D) return 0;
  if (B <= C + 1) return 1;
  A %= B;
  if (C + 1 <= A) return 0;
  long long L = C + 1 - A, R = B - 1 - A, g = gcd(B, D);
  if (L % g) L = (L + g - 1) / g * g;
  if (R % g) R = R / g * g;
  return L > R;
}
int main() {
  int t = rd();
  while (t--) {
    long long A, B, C, D;
    scanf("%lld%lld%lld%lld", &A, &B, &C, &D);
    puts(chk(A, B, C, D) ? "Yes" : "No");
  }
}
