#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;
}
const int N = 1e6 + 50;
int t;
long long A, B, C, D;
int chk() {
  if (A < B || D < B) return 0;
  if (B <= C && B <= D) return 1;
  set<int> s;
  while (1) {
    if (A < B) return 0;
    A %= B;
    if (s.count(A)) return 1;
    s.insert(A);
    if (A <= C) A += D;
  }
}
void work() {
  scanf("%lld%lld%lld%lld", &A, &B, &C, &D);
  puts(chk() ? "Yes" : "No");
}
int main() {
  scanf("%d", &t);
  while (t--) work();
}
