CF1829D.Gold Rush

Initially you have a single pile with $n$ gold nuggets. In an operation you can do the following:

• Take any pile and split it into two piles, so that one of the resulting piles has exactly twice as many gold nuggets as the other. (All piles should have an integer number of nuggets.)

One possible move is to take a pile of size $6$ and split it into piles of sizes $2$ and $4$, which is valid since $4$ is twice as large as $2$.

Can you make a pile with exactly $m$ gold nuggets using zero or more operations?

最开始你有一堆共 $n$ 块金块。每次操作你可以执行以下动作：

• 任选一堆，将其分成两堆，使得其中一堆的金块数量恰好是另一堆的两倍。（每堆的金块数量必须为整数。）

一种可行的操作是将大小为 $6$ 的一堆分成大小为 $2$ 和 $4$ 的两堆，这是合法的，因为 $4$ 恰好是 $2$ 的两倍。

你能否通过零次或多次上述操作，得到一堆恰好包含 $m$ 块金块？

The first line contains an integer $t$ ($1 \leq t \leq 1000$) — the number of test cases.

The only line of each test case contains two integers $n$ and $m$ ($1 \leq n, m \leq 10^7$) — the starting and target pile sizes, respectively.

第一行包含一个整数 $t$（$1 \leq t \leq 1000$）—— 测试用例的数量。

每个测试用例仅一行，包含两个整数 $n$ 和 $m$（$1 \leq n, m \leq 10^7$）—— 分别为初始堆大小和目标堆大小。

For each test case, output "YES" if you can make a pile of size exactly $m$, and "NO" otherwise.

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).

对于每个测试用例，如果你能恰好堆出大小为 $m$ 的堆，则输出 "YES"；否则输出 "NO"。

你可以以任意大小写形式输出答案（例如，字符串 "yEs"、"yes"、"Yes" 和 "YES" 均会被识别为肯定回答）。

The first test case is pictured in the statement. We can make a pile of size $4$.

In the second test case, we can perform the following operations: ${\color{red}{9}} \to {\color{red}{6},3} \to {4,2,3}$. The pile that is split apart is colored red before each operation.

In the third test case, we can't perform a single operation.

In the fourth test case, we can't end up with a larger pile than we started with.

第一个测试用例如题面图示所示。我们可以构造出一个大小为 $4$ 的堆。

在第二个测试用例中，我们可以执行如下操作：${\color{red}{9}} \to {\color{red}{6},3} \to {4,2,3}$。每次操作前，被分裂的堆以红色标出。

在第三个测试用例中，我们无法执行任何一次操作。

在第四个测试用例中，我们最终无法得到比初始堆更大的堆。