CF1257B.Magic Stick

Recently 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:

1. If the chosen number $a$ is even, then the spell will turn it into $\frac{3a}{2}$;
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.

最近，佩蒂亚在森林中散步时发现了一根魔法棒。

由于佩蒂亚非常喜欢数字，他最先学会的是改变数字的咒语。目前，他仅掌握两种可作用于正整数的咒语：

1. 若选定的数 $a$ 是偶数，则该咒语将其变为 $\frac{3a}{2}$；
2. 若选定的数 $a$ 大于 1，则该咒语将其变为 $a-1$。

注意：若一个数既是偶数又大于 1，则佩蒂亚可任选上述两种咒语之一来施放。

佩蒂亚现在手中只有一个数 $x$。他想知道，能否通过施放他所掌握的咒语（可任意次、任意顺序），从 $x$ 得到他最喜爱的数 $y$？允许不施放任何咒语，即 $x$ 可保持不变。

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.

第一行包含一个整数 $T$（$1 \le T \le 10^4$）——测试用例的数量。每个测试用例由两行组成。

每个测试用例的第一行包含两个整数 $x$ 和 $y$（$1 \le x, y \le 10^9$）——当前的数字以及 Petya 想要得到的数字。

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).

对于第 $i$ 个测试用例，请输出对应的答案——如果 Petya 能够通过已知的咒语将数字 $x$ 变为数字 $y$，则输出 YES；否则输出 NO。

你可以以任意大小写形式输出每个字母（例如，字符串 yEs、yes、Yes 和 YES 均被视为肯定回答）。