CF1491D.Zookeeper and The Infinite Zoo

There is a new attraction in Singapore Zoo: The Infinite Zoo.

The Infinite Zoo can be represented by a graph with an infinite number of vertices labeled $1,2,3,\ldots$. There is a directed edge from vertex $u$ to vertex $u+v$ if and only if $u\&v=v$, where $\&$ denotes the bitwise AND operation. There are no other edges in the graph.

Zookeeper has $q$ queries. In the $i$-th query she will ask you if she can travel from vertex $u_i$ to vertex $v_i$ by going through directed edges.

新加坡动物园新推出了一项景点：无限动物园（The Infinite Zoo）。

无限动物园可用一张包含无限多个顶点的有向图来表示，顶点编号为 $1,2,3,\ldots$。当且仅当 $u\&v=v$ 时，存在一条从顶点 $u$ 指向顶点 $u+v$ 的有向边，其中 $\&$ 表示按位与运算。图中不存在其他边。

动物园管理员共有 $q$ 个询问。在第 $i$ 个询问中，她将询问你：能否通过若干条有向边，从顶点 $u_i$ 到达顶点 $v_i$？

The first line contains an integer $q$ ($1 \leq q \leq 10^5$) — the number of queries.

The $i$-th of the next $q$ lines will contain two integers $u_i$, $v_i$ ($1 \leq u_i, v_i \lt 2^{30}$) — a query made by Zookeeper.

第一行包含一个整数 $q$（$1 \leq q \leq 10^5$）—— 查询的数目。

接下来的 $q$ 行中，第 $i$ 行包含两个整数 $u_i$、$v_i$（$1 \leq u_i, v_i \lt 2^{30}$）—— 这是动物园管理员提出的第 $i$ 个查询。

For the $i$-th of the $q$ queries, output "YES" in a single line if Zookeeper can travel from vertex $u_i$ to vertex $v_i$. Otherwise, output "NO".

You can print your answer in any case. For example, if the answer is "YES", then the output "Yes" or "yeS" will also be considered as correct answer.

对于 $q$ 个查询中的第 $i$ 个查询，如果动物园管理员能够从顶点 $u_i$ 到达顶点 $v_i$，则在单独一行中输出 “YES”；否则输出 “NO”。

您可以以任意大小写形式输出答案。例如，若正确答案为 “YES”，则输出 “Yes” 或 “yeS” 同样被视为正确答案。

The subgraph on vertices $1,2,3,4,5,6$ is shown below.

顶点 $1,2,3,4,5,6$ 上的子图如下所示。