use std::cmp::*;
use std::io::*;
use std::str::FromStr;
use utils::*;

pub fn main() {
    let i = stdin();
    let mut o = Vec::new();
    run(i.lock(), &mut o);
    stdout().write_all(&o).unwrap();
}

fn run<R: BufRead, W: Write>(i: R, o: &mut W) {
    let mut i = CpReader::new(i);
    let t = i.read::<usize>();
    let mut primes = Primes::new();
    for _ in 0..t {
        let (a, b, c, d) = i.read4::<usize, usize, usize, usize>();
        let result = if solve(a, b, c, d, &mut primes) {
            "Yes"
        } else {
            "No"
        };
        writeln!(o, "{}", result).unwrap();
    }
}
fn solve(mut a: usize, b: usize, c: usize, d: usize, primes: &mut Primes) -> bool {
    if a < b || d < b {
        return false;
    }
    if c >= b {
        return true;
    }
    a -= b;
    if a <= c {
        a += d;
    }
    let mut x = a - c - 1;
    let xt = b - c - 1;
    if xt == 0 {
        return true;
    }

    x -= x / b * b;
    if x < xt {
        return false;
    }

    let x0 = x;

    x += d - b;
    x -= x / b * b;
    if x < xt {
        return false;
    }
    let x1 = x;

    let xd = if x1 >= x0 { x1 - x0 } else { b + x0 - x1 };
    if xd == 0 {
        return true;
    }
    if primes.is_co_prime(b, xd) {
        return false;
    }

    if xd < b / 2 {
        x += ((b - x - 1) / xd + 1) * xd;
        x %= b;
        let x0 = x;
        if x < xt {
            return false;
        }

        loop {
            x += ((b - x - 1) / xd + 1) * xd;
            x %= b;
            if x < xt {
                return false;
            }
            if x == x0 {
                return true;
            }
        }
    } else {
        x -= x / xd * xd;
        if x < xt {
            return false;
        }
        let x0 = x;
        loop {
            x += b;
            x -= x / xd * xd;
            if x < xt {
                return false;
            }
            if x == x0 {
                return true;
            }
        }
    }
}

struct Primes {
    is_prime: Vec<bool>,
    primes: Vec<usize>,
}

impl Primes {
    fn new() -> Self {
        Primes {
            is_prime: vec![false, true],
            primes: Vec::new(),
        }
    }
    fn ready(&mut self, n: usize) {
        loop {
            let len = self.is_prime.len();
            if len > n {
                return;
            }
            let mut is_prime = true;
            for &p in &self.primes {
                if len % p == 0 {
                    is_prime = false;
                    break;
                }
            }
            if is_prime {
                self.primes.push(len);
            }
            self.is_prime.push(is_prime);
        }
    }
    fn is_co_prime(&mut self, n0: usize, n1: usize) -> bool {
        self.ready(max(n0, n1));
        for &p in &self.primes {
            if n0 % p != 0 && n1 % p != 0 {
                return false;
            }
        }
        true
    }
}

mod utils {
    use super::*;

    pub struct CpReader<R: BufRead> {
        r: R,
        s: String,
    }

    macro_rules! fn_read {
        {$f:ident($($v:ident: $t:ident),*)} => {
            pub fn $f<$($t: FromStr),*>(&mut self) -> ($($t),*) {
                let i = &mut self.read_line().split(' ');
                $(
                    let $v = i.next().unwrap().parse().ok().unwrap();
                )*
                ($($v),*)
            }
        };
    }

    impl<R: BufRead> CpReader<R> {
        pub fn new(r: R) -> Self {
            CpReader {
                r: r,
                s: String::new(),
            }
        }
        pub fn read_line(&mut self) -> &str {
            self.s.clear();
            self.r.read_line(&mut self.s).unwrap();
            self.s.trim()
        }

        pub fn read<T: FromStr>(&mut self) -> T {
            self.read_line().parse().ok().unwrap()
        }
        fn_read! { read4(v1: T1, v2: T2, v3: T3, v4: T4) }
    }
}
