#include <bits/stdc++.h>

    using namespace std;
    #define pb push_back
    #define eb emplace_back
    #define all(x) x.begin(), x.end()
    #define debug(x) cerr << #x <<": " << (x) << endl
    //Ã¥ï¿½Â¨Ã¦Â¯ï¿½Ã¤Â¸ÂªÃ¥ï¿½Â½Ã¦ï¿½Â°Ã§ï¿½ï¿½Ã¥ï¿½Â¥Ã¥ï¿½Â£Ã¥Â¤ï¿½Ã¦ï¿½Â§Ã¨Â¡ï¿½Ã¤Â¸ï¿½Ã¦Â¬Â¡Ã¯Â¼ï¿½Ã¥ï¿½ÂºÃ¥ï¿½Â£Ã¥Â¤ï¿½Ã¦ï¿½Â§Ã¨Â¡ï¿½Ã¤Â¸ï¿½Ã¦Â¬Â¡Ã£ï¿½ï¿½Ã§ï¿½Â¶Ã¥ï¿½ï¿½Ã¥Â°Â±Ã¥ï¿½Â¯Ã¤Â»Â¥Ã¥Â¿Â«Ã©ï¿½ï¿½Ã¥Â¾ï¿½Ã§ï¿½Â¥Ã¦ï¿½Â¯Ã¥ï¿½ÂªÃ¤Â¸ÂªÃ¥ï¿½Â°Ã¦ï¿½Â¹Ã¦Â®ÂµÃ©ï¿½ï¿½Ã¨Â¯Â¯Ã¤Âºï¿½
    #define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
    #ifdef LOCAL
    #define see(x) cout  << #x << ": " << (x) << endl
    #endif
    #ifndef LOCAL
    #define see(x)
    #endif


    #define rep(n) for(int _ = 0; _ != (n); ++_)
    //#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
    #define Rng(i, n) for(int i = 0; i != (n); ++i)
    #define rng(i, a, b) for(int i = (a); i < (b); ++i)
    #define RNG(i, a) for(auto &i: (a))
    #define dwn(i, r, l) for(int i = (r); i>=(l); i--)

    namespace std {
        template<class T>
        T begin(std::pair<T, T> p)
        {
            return p.first;
        }
        template<class T>
        T end(std::pair<T, T> p)
        {
            return p.second;
        }
    }


    #if __cplusplus < 201402L
    template<class Iterator>
    std::reverse_iterator<Iterator> make_reverse_iterator(Iterator it)
    {
        return std::reverse_iterator<Iterator>(it);
    }
    #endif

    template<class Range>
    std::pair<std::reverse_iterator<decltype(begin(std::declval<Range>()))>, std::reverse_iterator<decltype(begin(std::declval<Range>()))>> make_reverse_range(Range &&r)
    {
        return std::make_pair(make_reverse_iterator(::begin(r)), make_reverse_iterator(::end(r)));
    }

    #define RRNG(x, cont) for (auto &x: make_reverse_range(cont))



    template<class T> int sign(const T &a) { return a == 0 ? 0 : a > 0 ? 1 : -1; }
    template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}
    template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}
    template<class T> void Min(T &a, const T &b){ a = min(a, b); }
    template<class T> void Max(T &a, const T &b){ a = max(a, b); }

    template<typename T> void println(const T &t) { cout << t << '\n'; }
    template<typename T, typename ...Args> void println(const T &t, const Args &...rest) { cout << t << ' '; println(rest...); }

    template<typename T> void print(const T &t) { cout << t << ' '; }

    template<typename T, typename ...Args> void print(const T &t, const Args &...rest) { cout << t; print(rest...); }

    // this overload is chosen when there's only one argument
    template<class T> void scan(T &t) { cin >> t; }
    template<class T, class ...Args> void scan(T &a, Args &...rest) { cin >> a; scan(rest...); }

    using ll = long long;
    using ull = unsigned long long;
    using vec = vector<ll>;
    using mat = vector<vec>;
    using pii = pair<int, int>;
    using pdd = pair<double, double>;
    using pip = pair<int, pii>;
    using szt = size_t;
    using vi = vector<int>;
    using vl = vector<ll>;
    using vb = vector<bool>;
    using vpii = vector<pii>;
    using vvi = vector<vi>;
    using pli = pair<ll,int>;
    using wg = vector<vpii>; //weighted graph

    int cas;
    const double pi = acos(-1);
    ll mod = 1e9 + 7;

    template<class T>
    inline void add_mod(T &a, const T &b) {
        a += b;
        if (a >= mod) a -= mod;
    }
    template<class T>
    void sub_mod(T &a, const T &b){
        a -= b;
        if (a < 0) a += mod;
    }
    auto bo=[](int x){ //Ã¤Âºï¿½Ã¨Â¿ï¿½Ã¥ï¿½Â¶Ã¨Â¾ï¿½Ã¥ï¿½Âº
        bitset<5> a(x);
        cout << a << endl;
    };



    mat operator*(const mat &a, const mat &b) {
        mat c(a.size(), vec(b[0].size()));
        for (int i = 0; i < a.size(); i++) {
            for (int j = 0; j < a[0].size(); j++) {
                if (a[i][j]) { // optimization for sparse matrix
                    for (int k = 0; k < b[0].size(); k++) {
                        add_mod(c[i][k], a[i][j] * b[j][k] % mod);
                    }
                }
            }
        }
        return c;
    }

    vec operator*(const mat &a, const vec &b) {
        vec c(a.size());
        for (int i = 0; i < a.size(); i++) {
            for (int j = 0; j < a[0].size(); j++) {
                add_mod(c[i], a[i][j] * b[j] % mod);
            }
        }
        return c;
    }

    mat pow(mat a, ull n) {
        mat res(a.size(), vec(a[0].size()));
        for (int i = 0; i < a.size(); i++) {
            res[i][i] = 1;
        }
        while (n) {
            if (n & 1) {
                res = res * a;
            }
            a = a * a;
            n >>= 1;
        }
        return res;
    }

    std::ostream& operator<<(std::ostream& os, __int128 T) {
        if (T<0) os<<"-";
        if (T>=10 ) os<<T/10;
        if (T<=-10) os<<(-(T/10));
        return os<<( (int) (T%10) >0 ? (int) (T%10) : -(int) (T%10) ) ;
    }

    __int128 LPOW(__int128 x, ll n) {
        __int128 res = 1;
        for (; n; n /= 2, x *= x, x %= mod) {
            if (n & 1) {
                res *= x;
                res %= mod;
            }
        }
        return res;
    }

    ll POW(ll x, ll n){
        ll res = 1;
        for (; n; n /= 2, x *= x, x %= mod) {
            if (n & 1) {
                res *= x;
                res %= mod;
            }
        }
        return res;
    }


    ll INV(ll x) {
        return POW(x, mod - 2);
    }

    ll inv(ll x){
    //    see(x);
        return x == 1? 1: (mod - mod/x * inv(mod%x) % mod);
    }



    // 2D rotation
    void rotate(double &x, double &y, double theta) {
        double tx = cos(theta) * x - sin(theta) * y;
        double ty = sin(theta) * x + cos(theta) * y;
        x = tx, y = ty;
    }
    namespace bit {
        const int BIT_N = 1e5 + 5;

        int bit[BIT_N];

        int sum(int x) {
            int res = 0;
            while (x) {
                res += bit[x];
                x -= x & -x;
            }
            return res;
        }

        int sum(int l, int r) {
            if (l > r) return 0;
            return sum(r) - sum(l - 1);
        }

        void add(int x, int v, int n) {
            while (x <= n) {
                bit[x] += v;
                x += x & -x;
            }
        }
    }

    namespace util{
        int len(ll x){return snprintf(nullptr, 0, "%lld", x);}
        vi get_d(ll x){
            vi res;
            while(x) {
                res.pb(x%10);
                x /= 10;
            }
            reverse(all(res));
            return res;
        }
        template <class T> T parity(const T &a){
            return a & 1;
        }
        template <class T>
        void out (const vector<T> &a){
            std::copy(a.begin(), a.end(), std::ostream_iterator<T>(std::cout, ", "));
            cout << endl;
        };
    }

    using namespace util;

    // #include <ext/pb_ds/priority_queue.hpp>

    // typedef __gnu_pbds :: priority_queue<pip, less<pip>, __gnu_pbds::thin_heap_tag > Heap;

    // Heap h;

    // Heap::point_iterator pos[N][N];
    const ll LINF = LLONG_MAX/10;
    const int INF = INT_MAX/10;
    const int M = 3000 + 5;


    const int N = 5e5+5;

    struct edge{
        int v, i, next;
    } E[2*N];
    int last[N];
    int cnt;

    void insert(int u, int v, int i){
        E[++cnt] = {v, i, last[u]}; last[u] = cnt;
        E[++cnt] = {u, i, last[v]}; last[v] = cnt;
    }

    bool used[N];
    int size[N];
    int ma[N];
    int root, sum; // 当前子树中的节点数，求重心用

    void centroid(int u, int f){
        size[u]=1, ma[u] = 0;
        for(int i = last[u]; i; i = E[i].next){
            int &v = E[i].v;
            if(v!=f && !used[v]){
                centroid(v, u);
                size[u]+=size[v];
                ma[u] = max(ma[u], size[v]);
            }
        }
        ma[u]=max(ma[u], sum-size[u]);
        if(ma[root] > ma[u]) root = u;
    };

    int last_edge2[N][2][2]; // 表示从u出发的最长路的末边颜色数是否唯一
    inline int work(int u, int c) {
        if (c != last_edge2[u][0][0]){
            if (c != last_edge2[u][1][0]) return 0;
            else return last_edge2[u][0][1];
        } else return last_edge2[u][1][1];
    };

    // 重心分治T到死，启发式合并是正解？

    int main() {
        // Single Cut of Failure taught me
        cout << std::fixed; //
        cout << setprecision(10);
    //    ios::sync_with_stdio(false);
    //    cin.tie(nullptr);
    #ifdef LOCAL
        freopen("main.in", "r", stdin);
    //    freopen("main.out", "w", stdout);
    #endif
        int T;
        scan(T);
        while(T--) {
            ll a, b, c, d;
            scan(a, b, c, d);
            if (a < b || d < b) {
                println("No");
                continue;
            }
            if (c >= b - 1) {
                println("Yes");
                continue;
            }

            ll t = (a - c + b - 1) / b * b;
            t = max(t, b);
            a -= t;
            if (a < 0) {
                println("No");
                continue;
            }
            ll tmp = __gcd(d, b);
            if(tmp <= b-c-1){
                println("No");
            }
            else{
                println("Yes");
            }
            //

        }
    #ifdef LOCAL
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
        return 0;
    }


Measured memory_bytes: 256