The In-XOR-able Task

You are given a sequence of integers $A_1, A_2, \ldots, A_N$. You have to answer $Q$ queries. In each query, you are given two integers $L$ and $R$, and you have to find the number of ordered pairs $(X, Y)$ such that $L \le X, Y \le R$ and $A_X \le A_X \oplus A_Y \le A_Y$. Here, $\oplus$ is the bitwise XOR operator. ### Input - The first line of the input contains a single integer $T$ denot