import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;



void main() {
    int t;
    scan(t);

    while (t--) {
        long ai, bi, ci, di;
        scan(ai, bi, ci, di);
        writeln(solve(ai, bi, ci, di) ? "Yes" : "No");
    }
}

bool solve(long a, long b, long c, long d) {
    if (a < b) {
        return false;
    }
    if (b > d) {
        return false;
    }
    if (c >= b) {
        return true;
    }

    // a >= b, d >= b, b > c
    auto g = gcd(b, d);
    auto f = b - g + (a % g);
    if (f > c) {
        return false;
    }
    else {
        return true;
    }
}









































void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
