Permutation

• Reverse a subarray indexed by $[L,R](1\le L\le R \le |a|)$, that is, $\forall i\in [L,\frac{L + R}{2}]$, $\texttt{swap(a[i],a[R+L-i])}$.


• Complement the elements $a_i$ such that $L\le a_i\le R(1\le L\le R \le |a|)$, that is, $\forall L\le a_i\le R$, assign $\texttt{R+L-a[i]}$ to $\texttt{a[i]}$.


• Increase all the elements that is no less than $v(1\le v\le |a|+1)$ by $1$, and then insert $v$ before the $i(1\le i\le |a|)$th element. It's clear that the array becomes a permutation of $1...|a|+1$ after that.


• Given $i(1\le i\le |a|)$, print the value of $a_i$.


• Given $v(1\le v\le |a|)$, print the position of $v$.

• $\texttt{1 L R}$, asking you to reverse a subarray.


• $\texttt{2 L R}$, asking you to complement certain elements.


• $\texttt{3 i v}$, asking you to insert an element.


• $\texttt{4 i}$, asking you to print the value of the $i$th element.


• $\texttt{5 v}$, asking you to print the position of $v$.

1
5 5
1 2 3 4 5
1 1 3
2 1 5
3 1 2
4 6
5 2

1
1