No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Magic Stick

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRecently Petya walked in the forest and found a magic stick.

Since Petya really likes numbers, the first thing he learned was spells for changing numbers. So far, he knows only two spells that can be applied to a positive integer:

- If the chosen number $$$a$$$ is even, then the spell will turn it into $$$\frac{3a}{2}$$$;
- If the chosen number $$$a$$$ is greater than one, then the spell will turn it into $$$a-1$$$.

Note that if the number is even and greater than one, then Petya can choose which spell to apply.

Petya now has only one number $$$x$$$. He wants to know if his favorite number $$$y$$$ can be obtained from $$$x$$$ using the spells he knows. The spells can be used any number of times in any order. It is not required to use spells, Petya can leave $$$x$$$ as it is.

Input

The first line contains single integer $$$T$$$ ($$$1 \le T \le 10^4$$$) — the number of test cases. Each test case consists of two lines.

The first line of each test case contains two integers $$$x$$$ and $$$y$$$ ($$$1 \le x, y \le 10^9$$$) — the current number and the number that Petya wants to get.

Output

For the $$$i$$$-th test case print the answer on it — YES if Petya can get the number $$$y$$$ from the number $$$x$$$ using known spells, and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

Example

Input

7 2 3 1 1 3 6 6 8 1 2 4 1 31235 6578234

Output

YES YES NO YES NO YES YES

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2022 16:31:28 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|