Sliding Window RMQ

You are given a sequence $A_1,A_2,\ldots,A_N$ and an integer $K$. For each $i=K,K+1,\ldots,N$, consider the minimum of the $K$ consecutive elements $A_{i-K+1},\ldots,A_i$.

The sequence is generated rather than provided directly. For every $i\geq1$,

The values $A_0,a,c,m$ are given in the input.

The input is given in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each case, let $B_i=\min(A_{i-K+1},\ldots,A_i)$ for . Print on one line, where denotes bitwise XOR.

• $1\leq T\leq100\,000$.
• $1\leq K\leq10^6$.