Array

Consider an array $A$ that initially contains $n$ numbers. The elements of the array are numbered from left to right, starting from $1$. The following operations can be performed on this array:

• I $i$ $x$ — Insert the number $x$ after the element at position $i$. All numbers at positions greater than $i$ are shifted one position to the right, and the length of the array increases by $1$. Positions in the array are numbered starting from $1$. I 0 x means inserting an element at the very beginning of the array, I 1 x means inserting after the first element, and so on.

• D $i$ — Delete the element at position $i$. All numbers at positions greater than $i$ are shifted one position to the left, and the length of the array decreases by $1$.

• S i_1 i_2 $\text{len}$ — Swap the array segments [i_1,\ldots,i_1 + \text{len}] and [i_2,\ldots,i_2 + \text{len}]. As a result, for each k = 0, 1, \ldots, \text{len}, swap A_{i_1 + k} and A_{i_2 + k}. It is guaranteed that the segments [i_1,i_1 + \text{len}] and [i_2,i_2 + \text{len}] do not overlap.

• A $i$ — Output the number currently at position $i$.

You are to perform all described operations in the given order.