#include <bits/stdc++.h>
using namespace std;
inline void Input_Output() {}
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
inline void solve() {
  long long a, b, c, d;
  map<long long, long long> was;
  cin >> a >> b >> c >> d;
  while (!was.count(a)) {
    was[a] = 1;
    if (a < c) {
      a -= b;
    } else {
      a -= ((a - c + b - 1) / b) * b;
    }
    if (a < 0) {
      cout << "No\n";
      return;
    }
    a += d;
  }
  cout << "Yes\n";
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
