A11220. Yet Another Array Queries Problem

You are given an array $a$ of size $n$ , and $q$ queries to it. There are queries of two types:

- $1$ $l_{i}$ $r_{i}$ — perform a cyclic shift of the segment $[l_{i},r_{i}]$ to the right. That is, for every $x$ such that $l_{i}<=x<r_{i}$ new value of $a_{x+1}$ becomes equal to old value of $a_{x}$ , and new value of $a_{li}$ becomes equal to old value of $a_{ri}$ ;
- $2$ $l_{i}$ $r_{i}$ — reverse the segment $[l_{i},r_{i}]$ .

There are $m$ important indices in the array $b_{1}$ , $b_{2}$ , ..., $b_{m}$ . For each $i$ such that $1<=i<=m$ you have to output the number that will have index $b_{i}$ in the array after all queries are performed.

The first line contains three integer numbers $n$ , $q$ and $m$ ( $1<=n,q<=2·10^{5}$ , $1<=m<=100$ ).

The second line contains $n$ integer numbers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ ( $1<=a_{i}<=10^{9}$ ).

Then $q$ lines follow. $i$ -th of them contains three integer numbers $t_{i}$ , $l_{i}$ , $r_{i}$ , where $t_{i}$ is the type of $i$ -th query, and $[l_{i},r_{i}]$ is the segment where this query is performed ( $1<=t_{i}<=2$ , $1<=l_{i}<=r_{i}<=n$ ).

The last line contains $m$ integer numbers $b_{1}$ , $b_{2}$ , ..., $b_{m}$ ( $1<=b_{i}<=n$ ) — important indices of the array.

Print $m$ numbers, $i$ -th of which is equal to the number at index $b_{i}$ after all queries are done.