Just these days, we've learned about "Queue". It's a kind of data structure.
Elaine is cranky. She made her own Queue.
That Queue only has two operations:

• Top x : Make the element x to the top of the Queue.
• Next: Output the top element and pop it and then push it to the back of the Queue.

SORRY, because of the bug of Judge Core. The code "remove" will be judged as "DANGEROUS_CODE". We will fix it next time.

The first line is an integer T, indicates the number of cases.
Then follow T cases.
The first line of each case has two integer n and m (n, m <= 1000), indicate the number of elements and operations.
Then follow m lines of operations. Each line is an operation.

For each "Next" operation, output the answer.