Binary Strings

In ShareChat, there is a sequence of binary integers $A_1, A_2, \ldots, A_N$. You should answer $Q$ queries on this sequence. In each query, you are given two indices $L$ and $R$ and a binary integer $X$. The answer to a query is the smallest index $i$ ($L \le i \le R$) such that the value $A_i \oplus X$ is maximum possible, i.e. equal to $\mathrm{max}(A_L \oplus X, A_{L+1} \oplus X, \ldots, A_