Double Shuffle

**This is the easy version of the problem. The only difference between this and the hard version is that here, $Q = 0$, i.e. there are no updates.** You're given a permutation$^\dagger$ $P$ of the integers $1$ to $N$. There is beauty in order, so you'll only be satisfied if $P$ is sorted in ascending order, i.e. $P_i \lt P_{i+1}$ for each index $i$ from $1$ to $N-1$. To achieve this, you can p