Mystical Numbers

A number $M$ is said to be a *Mystical Number* with respect to a number $X$ if $(M \oplus X) \gt (M \& X)$. You are given an array $A$ of size $N$. You are also given $Q$ queries. Each query consists of three integers $L$, $R$, and $X$. For each query, find the count of *Mystical Numbers* in the subarray $A[L:R]$ with respect to the number $X$. **Notes:** - $\oplus$ represents the [Bitwise XOR