A warehouse installs a single barcode scanner above a conveyor belt. As boxes pass beneath the scanner, it logs the item code of each box, in order, starting from scan position 0. The warehouse manager is auditing deliveries of one particular item code: for a list of ranks, she wants to know at which scan position the k-th delivery of that code passed the scanner.

Input format

• Line 1: two integers n and x — the number of scanned entries and the target item code.
• Line 2: n integers codes[0] codes[1] ... codes[n-1] — the scan log, in order.
• Line 3: an integer q — the number of queries.
• Line 4: q integers k_1 k_2 ... k_q — for each query, the requested occurrence rank (1-indexed: k=1 means the first time the target code appeared).

Output format

Print q integers separated by single spaces on one line. For each query k_i, print the scan position (0-indexed) at which the k_i-th occurrence of x in codes occurred, or -1 if x occurs fewer than k_i times in codes.

Constraints

• 1 <= n <= 10^5
• 1 <= q <= 10^5
• 1 <= codes[i], x <= 10^4
• 1 <= k_i <= n

7 4
1 3 4 2 4 4 4
2
1 3

2 5

4 9
9 9 9 9
3
1 4 5

0 3 -1