The Boss's Identity

Description:

Input:

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10\,000$$$). The description of the test cases follows.

The first line of each test case contains two integers $$$n$$$ and $$$q$$$ ($$$2 \leq n \leq 2 \cdot 10^5$$$ , $$$1 \leq q \leq 2 \cdot 10^5$$$).

The second line of each test case contains $$$n$$$ integers $$$a_1,a_2,\ldots,a_n$$$ ($$$0 \leq a_i \leq 10^9$$$) — the parts of the code which define the pattern.

The $$$i$$$-th line of the next $$$q$$$ lines contain a single integer $$$v_i$$$ ($$$0 \leq v_i \leq 10^9$$$) — the question Giorno asks you.

The sum of $$$n$$$ and $$$q$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.

Output:

Print $$$q$$$ numbers. The $$$i$$$-th number is the answer to the $$$i$$$-th question asked by Giorno.

Sample Input:

3
2 3
2 1
1
2
3
4 5
0 2 1 3
0
1
2
3
4
5 5
1 2 3 4 5
7
2
6
0
4

Sample Output:

1
3
-1
2
2
4
-1
-1
-1
3
8
1
5

Note:

In the first test case, $$$a = [2,1,3,3,\ldots]$$$.

• For the first question, $$$a_1=2$$$ is the element with the smallest index greater than $$$1$$$.
• For the second question, $$$a_3=3$$$ is the element with the smallest index greater than $$$2$$$.
• For the third question, there is no index $$$i$$$ such that $$$a_i > 3$$$.