queuestack

Dohyeon, idly enjoying his vacation, suddenly came up with an interesting data structure. He named it queuestack.

The structure of queuestack is as follows. Data structures numbered $1$, $2$, ..., $N$ (each a queue or a stack) are lined up, and each data structure holds one element.

queuestack works as follows.

• Read $x_0$.
• Insert $x_0$ into data structure $1$, then pop an element from data structure $1$. Call the popped element $x_1$.
• Insert $x_1$ into data structure $2$, then pop an element from data structure $2$. Call the popped element $x_2$.
• ...
• Insert $x_{N-1}$ into data structure $N$, then pop an element from data structure $N$. Call the popped element $x_N$.
• Return $x_N$.

Dohyeon takes a sequence $C$ of length $M$ and inserts its elements into queuestack one by one from front to back. The results of previous insertions remain. (See Sample $1$.)

Given the elements to insert into queuestack, write a program that outputs the return value for each insertion.

The first line gives the number of data structures $N$ that make up queuestack. ($1 \leq N \leq 100\,000$)

The second line gives a sequence $A$ of length $N$. If data structure $i$ is a queue then $A_i = 0$, and if it is a stack then $A_i = 1$.

The third line gives a sequence $B$ of length $N$. $B_i$ is the element held in data structure $i$. ($1 \leq B_i \leq 1\,000\,000\,000$)

The fourth line gives the length $M$ of the sequence to insert. ($1 \leq M \leq 100\,000$)

The fifth line gives a sequence $C$ of length $M$ containing the elements to insert into queuestack. ($1 \leq C_i \leq 1\,000\,000\,000$)

All numbers in the input are integers.

For each element of sequence $C$ inserted into queuestack in order, output the return value, separated by spaces.