Xor Jar Muluk Tar

Recently, Chef found a new formula for computing powers of a sequence: - You are given two sequences $A_1, A_2, \ldots, A_N$ and $(l_1, r_1), (l_2, r_2), \ldots, (l_N, r_N)$. - The $1$-st power of the sequence $A$ is $A^1 = A$. - For each $k \gt 1$, the $k$-th power of the sequence $A$ (denoted by $A^k$) is a sequence with length $N$ such that for each valid $i$, the $i$-th element of this sequ