Time Limit: 1000ms
Memory Limit: 65536kb
DescriptionOur 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:
Let us describe the sequence of transactions by two integer arrays:
1. 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 1 we have A=(3, 1, -4, 2, 8, -1000, 2).
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 1 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.
Inputnput 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. There maybe several cases.
OutputWrite to the output Black Box answers sequence for a given sequence of transactions. The numbers must be separated with end-of-line characters.You must seperate all the sequences by a single empty line.
7 4 3 1 -4 2 8 -1000 2 1 2 6 6
3 3 1 2