You are given an array of N integers, A1, A2, . . . , AN , and M integers, X1, X2, . . . , XM. For each Xi where i is an integer from 1 to M, you are asked to find the minimum index Y , such that the minimum value of (A1, A2, . . . , AY ) <= Xi .

Format Input

The first line consist of two integers, N and M. The second line consist of N integers, A1, A2, . . . , AN . The third line consist of M integers, X1, X2, . . . , XM.

Format Output

Output M lines, each consist of an integer which is the minimum index Y , such that the minimum value of (A1, A2, . . . , AY ) <= Xi . If no such Y is found, output -1.

Constraints

1 N, M 10⁵

1 Ai , Xi 10⁹

Sample Input 1 (standard input)

7 4

3 3 3 3 2 2 2

1 3 2 8

Sample Output 1 (standard output)

-1

1

5

1

NOTE: USE C LANGUAGE, USE stdio.h library (MUST) or string.h if needed. (DONT USE stdlib.h and algorithm library)