TT had passed the first challenge, now she faced the second one. This time Mr.Cai gave TT some number, and some commands: X dir Y, dir include L and R, if L means put Y left X, if R, put Y right X.
TT played the woman to Mr.Cai, so Mr.Cai had to lower the difficulty, he said all numbers would not repeat more than twice, that means you can find the only position X.

There are many cases. Each include a integer N(1 <= N <= 1000), then followed N numbers. Next line a integet K(1 <= K <=80000), then K lines followed. Each line with a command.All number will no more than the range of K+N.

For each case, output the final array in a single line.