#215294. [SWERC 2025] Hyper Smawk Bros

You and Bob are playing Hyper Smawk Bros against each other, facing a single boss with health . You and Bob act alternately, and you start. On your turn, you may use an attack that deals an integer amount of damage in , replacing with . However, you cannot use the same that your opponent just used on the previous turn (on the very first move of the game, any in is allowed).

The winner is the first player to reduce the boss’s health to . Determine whether you can force a win if Bob plays optimally.

Each test contains multiple test cases. The first line contains the number of test cases (). The description of the test cases follows.

The only line of each test case contains two integers (, ) — the starting health and the maximum damage per attack .

Note that there are no constraints on the sum of over all test cases, and there are no constraints on the sum of over all test cases.

For each test case, output YES if you can force a win against Bob, and NO otherwise.

The judge is case-insensitive (for example, YES, Yes, yes, yEs will all be recognized as positive answers).

样例输入 1

8
6 9
20 10
69 2
42 9
42 10
44 9
44 10
400000 400000

样例输出 1

YES
YES
NO
NO
YES
YES
NO
YES

Explanation of sample 1.

In the first test case, you can win immediately by dealing damage , so that becomes .

In the second test case,

• you choose to deal damage ;
• Bob can choose to deal any damage in different from ;
• then you can choose to deal damage and win.

In the third test case,

• either you start by dealing damage , then Bob must deal damage , then you must deal damage , etc.;
• or you start by dealing damage , then Bob must deal damage , then you must deal damage , etc.

In both cases, you lose.