Write a program which reads a sequence of integers $A = \{a_0, a_1, ..., a_{n-1}\}$ and reverse specified elements by a list of the following operation:
The input is given in the following format.
$n$ $a_0 \; a_1 \; ...,\; a_{n-1}$ $q$ $b_1 \; e_1$ $b_2 \; e_2$ : $b_{q} \; b_{q}$
In the first line, $n$ (the number of elements in $A$) is given. In the second line, $a_i$ (each element in $A$) are given. In the third line, the number of queries $q$ is given and each query is given by two integers $b_i \; e_i$ in the following $q$ lines.
Print all elements of $A$ in a line after performing the given operations. Put a single space character between adjacency elements and a newline at the end of the last element.
8 1 2 3 4 5 6 7 8 2 1 6 3 8
1 6 5 8 7 2 3 4