#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>

#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x)  cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR 
#endif
using namespace std;

using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;

//struct edge {int from, to, cost;};

constexpr double EPS = 1e-10;
constexpr double PI  = acos(-1.0);
//constexpr int INF = INT_MAX;

template<class T> inline T sqr(T x) {return x*x;}

LL gcd(LL m, LL n) {
    if (m < n) swap(m,n);
    while (n > 0) {
        m %= n;
        swap(m,n);
    }
    return m;
}

void solve() {
    int t;
    cin >> t;
    LL a,b,c,d;
    REP(i,0,t) {
        cin >> a >> b >> c >> d;
        // LL m = gcd(gcd(a,b), gcd(c,d));
        LL m = gcd(gcd(a,b), d);
        while (m > 1) {
            a /= m;
            b /= m;
            c /= m;
            d /= m;
            // m = gcd(gcd(a,b), gcd(c,d));
            m = gcd(gcd(a,b), d);
        }
        // cerr << a << " " << b << " " << c << " " << d << endl;
        if (a < b || b > d) {
            cout << "No" << endl;
            continue;
        }
        if (b <= c + 1) {
            cout << "Yes" << endl;
            continue;
        }
        if (d % b == 0) {
            if (a % b <= c) cout << "Yes" << endl;
            else cout << "No" << endl;
            continue;
        }
        cout << "No" << endl;
    }
}

int main() {
    solve();
    
    return 0;
}