Triple Sort

You are given a permutation $p_1, p_2, \ldots, p_N$ of the integers $1$ through $N$. You may perform up to $K$ operations of the following type: - Choose three pairwise distinct valid indices $i_1, i_2, i_3$. Note that these indices do not have to be chosen in increasing order. - Let's denote the values of $p_{i_1}$, $p_{i_2}$ and $p_{i_3}$ before this operation by $v_1$, $v_2$ and $v_3$ respect