Array Rotation Returns

You are given a sequence $A_1, A_2, \ldots, A_N$ which contains pairwise distinct elements and a sequence $B_1, B_2, \ldots, B_N$, which also contains pairwise distinct elements (but not necessarily distinct from elements of $A$). For each valid $i$, $1 \leq A_i, B_i \leq 2 \cdot N$. You may rotate $B$ as many times as you want. A rotation consists of moving the first element of the sequence to t