Our Black Box represents a primitive database. It can save an integer array and has a special i variable.
At the initial moment Black Box is empty and i equals 0. This Black Box processes a sequence of
commands (transactions). There are two types of transactions:
ADD(x): put element x into Black Box;
GET: increase i by 1 and give an i-minimum out of all integers containing in the Black Box.
Keep in mind that i-minimum is a number located at i-th place after Black Box elements sorting
by non-descending.
Example
Let us examine a possible sequence of 11 transactions:
(Black Box contents after transaction are arranged by non-descending)
It is required to work out an efficient algorithm which treats a given sequence of transactions. The
maximum number of ADD and GET transactions: 30000 of each type.
Let us describe the sequence of transactions by two integer arrays:
A(1), A(2), . . . , A(M ): a sequence of elements which are being included into Black Box. A values are integers not exceeding 2 000 000 000 by their absolute value, M ≤ 30000 . For the Example we have A = (3, 1, −4, 2, 8, −1000, 2).
u(1), u(2), . . . , u(N ) : a sequence setting a number of elements which are being included into Black Box at the moment of first, second, ... and N -transaction GET. For the Example we have u = (1, 2, 6, 6).
The Black Box algorithm supposes that natural number sequence u(1), u(2), . . . , u(N ) is sorted in
non-descending order, N ≤ M and for each p (1 ≤ p ≤ N ) an inequality p ≤ u(p) ≤ M is valid. It
follows from the fact that for the p-element of our u sequence we perform a GET transaction giving
p-minimum number from our A(1), A(2), . . . , A(u(p)) sequence.
Input
The first line of the input is an integer K, then a blank line followed by K datasets. There is a blank
line between datasets.
Input for each dataset contains (in given order): M, N, A(1), A(2), . . . , A(M ), u(1), u(2), . . . , u(N ).
All numbers are divided by spaces and (or) carriage return characters.
Output
For each dataset, write to the output Black Box answers sequence for a given sequence of transactions.
Write only a number per line in the output.
