Algorithms and Data Structures

Find smaller values

Given two arrays a and b, for each element of array b, you are asked to calculate the number of elements in a that are smaller than or equal to it.

Input

The input contains two integers n and m (1 ≤ n, m ≤ ) the sizes of a and b.

The second line contains n elements representing the elements of a ().

The final line contains m integers representing the elements of b().

Output

The program should print m integers separated by a space, each one representing the number of elements in a smaller than or equal to the corresponding element in b.

Examples

Input

Output

5 4
7 9 1 5 3
6 8 2 4

3 4 1 2

5 5
1 1 5 2 2
5 4 3 1 1

5 4 4 2 2

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue