#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long int;
const ll MD = 1000000007ll;
const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) {
  if (!assertion) {
    cerr << "assertion fault:" << endl;
    f();
    abort();
  }
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& o, const pair<T1, T2> p) {
  o << '(' << p.first << ':' << p.second << ')';
  return o;
}
template <typename Vec>
inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
  os << '[';
  for (const auto& e : a) os << ' ' << e << ' ';
  os << ']';
  return os;
}
template <typename T>
inline ostream& operator<<(ostream& o, const vector<T>& v) {
  return _ostream_vecprint(o, v);
}
template <typename T, size_t S>
inline ostream& operator<<(ostream& o, const array<T, S>& v) {
  return _ostream_vecprint(o, v);
}
template <typename T>
inline T& maxset(T& to, const T& val) {
  return to = max(to, val);
}
template <typename T>
inline T& minset(T& to, const T& val) {
  return to = min(to, val);
}
void bye(string s, int code = 0) {
  cout << s << endl;
  exit(code);
}
mt19937_64 randdev(8901016);
template <typename T>
inline T rand(T l, T h) {
  return uniform_int_distribution<T>(l, h)(randdev);
}
template <>
inline double rand<double>(double l, double h) {
  return uniform_real_distribution<double>(l, h)(randdev);
}
template <>
inline float rand<float>(float l, float h) {
  return uniform_real_distribution<float>(l, h)(randdev);
}
namespace {
class MaiScanner {
 public:
  template <typename T>
  void input_integer(T& var) {
    var = 0;
    T sign = 1;
    int cc = getchar_unlocked();
    for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() { return getchar_unlocked(); }
  inline MaiScanner& operator>>(int& var) {
    input_integer<int>(var);
    return *this;
  }
  inline MaiScanner& operator>>(long long& var) {
    input_integer<long long>(var);
    return *this;
  }
  inline MaiScanner& operator>>(string& var) {
    int cc = getchar_unlocked();
    for (; !(0x21 <= (cc) && (cc) <= 0x7E); cc = getchar_unlocked())
      ;
    for (; (0x21 <= (cc) && (cc) <= 0x7E); cc = getchar_unlocked())
      var.push_back(cc);
    return *this;
  }
  template <typename IT>
  void in(IT begin, IT end) {
    for (auto it = begin; it != end; ++it) *this >> *it;
  }
};
class MaiPrinter {
 public:
  template <typename T>
  void output_integer(T var) {
    if (var == 0) {
      putchar_unlocked('0');
      return;
    }
    if (var < 0) putchar_unlocked('-'), var = -var;
    char stack[32];
    int stack_p = 0;
    while (var) stack[stack_p++] = '0' + (var % 10), var /= 10;
    while (stack_p) putchar_unlocked(stack[--stack_p]);
  }
  inline MaiPrinter& operator<<(char c) {
    putchar_unlocked(c);
    return *this;
  }
  inline MaiPrinter& operator<<(int var) {
    output_integer<int>(var);
    return *this;
  }
  inline MaiPrinter& operator<<(long long var) {
    output_integer<long long>(var);
    return *this;
  }
  inline MaiPrinter& operator<<(char* str_p) {
    while (*str_p) putchar_unlocked(*(str_p++));
    return *this;
  }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putchar_unlocked(*p++);
    return *this;
  }
  template <typename IT>
  void join(IT begin, IT end, char sep = ' ') {
    for (bool b = 0; begin != end; ++begin, b = 1)
      b ? *this << sep << *begin : *this << *begin;
  }
};
}  // namespace
MaiScanner scanner;
MaiPrinter printer;
bool guchokuu(ll a, ll b, ll c, ll d) {
  for (remove_reference<remove_const<decltype(999)>::type>::type t = 0;
       (t) < (999); ++(t)) {
    if (a > b) return false;
    a -= b;
    if (a <= c) a += d;
  }
  return true;
}
bool guchoku(ll a, ll b, ll c, ll d) {
  if (a < b) return false;
  if (b > d) return false;
  if (b - 1 <= c) return 0;
  unordered_set<ll> used;
  used.insert(a);
  for (remove_reference<remove_const<decltype(99999)>::type>::type t = 0;
       (t) < (99999); ++(t)) {
    a -= (a - c) / b * b;
    if (a >= b) a -= b;
    if (a > c) return false;
    if (used.count(a)) return true;
    used.insert(a);
    a += d;
  }
  return true;
}
int solve(ll a_zaiko, ll b_snuke, ll c_threshold, ll d_rng) {
  if (a_zaiko < b_snuke) return 1;
  if (b_snuke > d_rng) return 2;
  if (b_snuke - 1 <= c_threshold) return 0;
  return guchoku(a_zaiko, b_snuke, c_threshold, d_rng) ? 0 : 3;
  return 0;
}
void test() {
  for (remove_reference<remove_const<decltype(2000)>::type>::type _ = 0;
       (_) < (2000); ++(_)) {
    ll a, b, c, d;
    a = rand(1, 33);
    b = rand(1, 33);
    c = rand(1, 33);
    d = rand(1, 33);
    bool ex = guchoku(a, b, c, d);
    int ac = solve(a, b, c, d);
    if (ex != (ac == 0)) {
      cout << "fault" << endl;
      cout << a << " " << b << " " << c << " " << d << endl;
      cout << ac << endl;
      exit(0);
    }
  }
  cout << "ac" << endl;
}
void test2() {
  for (remove_reference<remove_const<decltype(300)>::type>::type _ = 0;
       (_) < (300); ++(_)) {
    ll a, b, c, d;
    a = rand(1ll, 999999999999999985ll);
    b = rand(1ll, 999999999999999985ll);
    c = rand(1ll, 999999999999999985ll);
    d = rand(1ll, 999999999999999985ll);
    solve(a, b, c, d);
  }
  cout << "ac" << endl;
}
int main() {
  {
    int T;
    scanner >> T;
    for (remove_reference<remove_const<decltype(T)>::type>::type lop = 0;
         (lop) < (T); ++(lop)) {
      ll a, b, c, d;
      scanner >> a >> b >> c >> d;
      int res = solve(a, b, c, d);
      if (res == 0)
        printer << "Yes\n";
      else
        printer << "No\n";
    }
  }
  return 0;
}
