{"problem":{"name":"rng_10s","description":{"content":"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. ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc026_b"},"statements":[{"statement_type":"Markdown","content":"Ringo Mart, a convenience store, sells apple juice.\nOn 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.\nDetermine 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.\nNote that each test case in this problem consists of $T$ queries.\n\n## Constraints\n\n*   $1 \\leq T \\leq 300$\n*   $1 \\leq A, B, C, D \\leq 10^{18}$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$T$\n$A_1$ $B_1$ $C_1$ $D_1$\n$A_2$ $B_2$ $C_2$ $D_2$\n$:$\n$A_T$ $B_T$ $C_T$ $D_T$\n\nIn the $i$\\-th query, $A = A_i, B = B_i, C = C_i, D = D_i$.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc026_b","tags":[],"sample_group":[["14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985","No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n$9$ →D $2$ →N $11$ →D $4$ →N $13$ →D $6$ →N $6$ →D x\nIn the second query, the number of cans of juice in stock changes as follows:\n$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 …\nand so on, thus Snuke can buy juice indefinitely."],["24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1","No\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo"]],"created_at":"2026-03-03 11:01:13"}}