Counting Inversions Again!

You are given a sequence of non-negative integers $A_1, A_2, \ldots, A_N$. A pair $(x, y)$, where $1 \le x \lt y \le N$, is an *inversion* if $A_x \gt A_y$. You should answer $Q$ queries (numbered $1$ through $Q$). For each valid $i$, in the $i$-th query: - You are given a non-negative integer $K_i$. - Consider a sequence $B_1, B_2, \ldots, B_N$, where $B_j = A_j \oplus K$ for each valid $j$. - Y