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](https://en.wikipedia.org/wiki/Bitwise_operation#AND). 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.

N/A

N/A

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