Problem:
Score : 600 points

Problem Statement

Ringo Mart, a convenience store, sells apple juice.

On the opening day of Ringo Mart, there were A cans of juice in stock in the morning.
Snuke buys B cans of juice here every day in the daytime.
Then, the manager checks the number of cans of juice remaining in stock every night.
If there are C or less cans, D new cans will be added to the stock by the next morning.

Determine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.
Nobody besides Snuke buy juice at this store.

Note that each test case in this problem consists of T queries.

Constraints

1 \leq T \leq 300

1 \leq A, B, C, D \leq 10^{18}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

T
A_1 B_1 C_1 D_1
A_2 B_2 C_2 D_2
:
A_T B_T C_T D_T

In the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.

Output

Print T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.

Sample Input 1

14
9 7 5 9
9 7 6 9
14 10 7 12
14 10 8 12
14 10 9 12
14 10 7 11
14 10 8 11
14 10 9 11
9 10 5 10
10 10 5 10
11 10 5 10
16 10 5 10
1000000000000000000 17 14 999999999999999985
1000000000000000000 17 15 999999999999999985

Sample Output 1

No
Yes
No
Yes
Yes
No
No
Yes
No
Yes
Yes
No
No
Yes

In the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)

9
→D 2
→N 11
→D 4
→N 13
→D 6
→N 6
→D x

In the second query, the number of cans of juice in stock changes as follows:

9
→D 2
→N 11
→D 4
→N 13
→D 6
→N 15
→D 8
→N 8
→D 1
→N 10
→D 3
→N 12
→D 5
→N 14
→D 7
→N 7
→D 0
→N 9
→D 2
→N 11
→D …

and so on, thus Snuke can buy juice indefinitely.

Sample Input 2

24
1 2 3 4
1 2 4 3
1 3 2 4
1 3 4 2
1 4 2 3
1 4 3 2
2 1 3 4
2 1 4 3
2 3 1 4
2 3 4 1
2 4 1 3
2 4 3 1
3 1 2 4
3 1 4 2
3 2 1 4
3 2 4 1
3 4 1 2
3 4 2 1
4 1 2 3
4 1 3 2
4 2 1 3
4 2 3 1
4 3 1 2
4 3 2 1

Sample Output 2

No
No
No
No
No
No
Yes
Yes
No
No
No
No
Yes
Yes
Yes
No
No
No
Yes
Yes
Yes
No
No
No

Solution in Rust (1.15.1) (judge verdict: Time Limit Exceeded)

use std::str::FromStr;
use std::io::prelude::*;

trait FromFragment: Sized {
    fn from_fragment(s: &str) -> Result<Self, String>;
}

impl FromFragment for String {
    fn from_fragment(s: &str) -> Result<String, String> { Ok(s.to_string()) }
}

// impl FromFragment for bool

macro_rules! impl_from_fragment {
    ( $( $t:ty )* ) => { $(
        impl FromFragment for $t {
            fn from_fragment(s: &str) -> Result<$t, String> {
                <$t>::from_str(s).map_err(|_| {
                    format!("cannot parse \"{}\" as {}", s, stringify!($t))
                })
            }
        }
    )* };
}

impl_from_fragment!(f64 isize i8 i16 i32 i64 usize u8 u16 u32 u64);

trait FromLine: Sized {
    fn from_line(line: &str) -> Result<Self, String>;
}

impl<T: FromFragment> FromLine for T {
    fn from_line(line: &str) -> Result<T, String> {
        T::from_fragment(line.trim_right_matches('\n'))
    }
}

impl<T: FromFragment> FromLine for Vec<T> {
    fn from_line(line: &str) -> Result<Vec<T>, String> {
        let mut result = Vec::new();
        for fragment in line.trim_right_matches('\n').split_whitespace() {
            match T::from_fragment(fragment) {
                Ok(v) => result.push(v),
                Err(msg) => {
                    return Err(format!(
                        "fragment {} of line \"{}\": {}",
                        result.len() + 1, line, msg
                    ))
                }
            }
        }
        Ok(result)
    }
}

macro_rules! impl_from_line_for_tuples {
    ($t:ident $var:ident $count:expr) => ();
    ($t:ident $var:ident $count:expr, $($inner_t:ident $inner_var:ident $inner_count:expr),*) => {
        impl <$t: FromFragment + std::fmt::Display, $($inner_t: FromFragment + std::fmt::Display),*> FromLine for ($t, $($inner_t),*) {
            fn from_line(line: &str) -> Result<( $t, $($inner_t),*), String> {
                let fragments: Vec<&str> =
                    line.trim_right_matches('\n').split_whitespace().collect();
                if fragments.len() != $count {
                    return Err(format!(
                        "line \"{}\" has {} fragments, expected {}",
                        line, fragments.len(), $count
                    ));
                }

                let mut iter = fragments.iter();
                let mut n = 1;
                let $var = <$t>::from_fragment(iter.next().unwrap())
                    .map_err(|msg| {
                        format!("fragment {} of line \"{}\": {}", n, line, msg)
                    })?;
                n += 1;
                $(
                    let $inner_var =
                        <$inner_t>::from_fragment(iter.next().unwrap())
                        .map_err(|msg| {
                            format!("fragment {} of line \"{}\": {}",
                                    n, line, msg)
                        })?;
                    n += 1;
                )*
                Ok(( $var, $($inner_var),* ))
            }
        }
        impl_from_line_for_tuples!($($inner_t $inner_var $inner_count),*);
    }
}

impl_from_line_for_tuples!(T4 x4 4, T3 x3 3, T2 x2 2, T1 x1 1);

macro_rules! read {
    // Discard a line
    (_) => {
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).unwrap();
    };

    // Get a FromLine
    ( $pat:pat = $t:ty ) => {
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).unwrap();
        let $pat = <$t>::from_line(&line).unwrap();
    };

    // Get FromFragment's
    ( $( $pat:pat = $t:ty ),* ) => {
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).unwrap();

        let mut iter = line.split_whitespace();
        let mut n = 1;
        $(
            let fragment = iter.next().unwrap_or_else(|| {
                panic!(
                    "line \"{}\" has only {} fragment(s), more fragments needed",
                    line, n-1
                )
            });
            let $pat = <$t>::from_fragment(fragment).unwrap_or_else(|msg| {
                panic!("fragment {} of line \"{}\": {}", n, line, msg)
            });
            n += 1;
        )*

        if let Some(fragment) = iter.next() {
            panic!(
                "line \"{}\" not exhasted: only {} fragments read, \
                 leaving the next fragment \"{}\"",
                line, n-1, fragment
            );
        }
    };
}

macro_rules! read_n {
    // Get FromLine's
    ( $( $pat:pat = $t:ty ),* ) => {
        $(
            read!($pat = $t);
        )*
    }
}

macro_rules! read_loop {
    ( $pat:pat = $t:ty; $block:block ) => {
        let stdin = std::io::stdin();
        for line in stdin.lock().lines() {
            let line = line.expect("read from stdin failed");
            let $pat = <$t>::from_line(&line).unwrap();
            $block
        }
    }
}

use std::collections::HashSet;

fn solve((mut a, b, c, d): (i64, i64, i64, i64), mut acc: HashSet<i64>) -> bool {
    loop {
        if (acc.contains(&a)) {
            return true;
        }
        if (a < b || a % b > c) {
            return false;
        }
        acc.insert(a);
        let n = std::cmp::max((a-c + b-1) / b, 1);
        a = a - n*b + d;
    }
}

fn main() {
    read!(_);
    read_loop!(pair = (i64, i64, i64, i64); {
        // println!("{:?}", pair);
        if (solve(pair, HashSet::new())) {
            println!("Yes");
        } else {
            println!("No");
        }
    });
}