Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Queries about less or equal elements

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given two arrays of integers *a* and *b*. For each element of the second array *b*_{j} you should find the number of elements in array *a* that are less than or equal to the value *b*_{j}.

Input

The first line contains two integers *n*, *m* (1 ≤ *n*, *m* ≤ 2·10^{5}) — the sizes of arrays *a* and *b*.

The second line contains *n* integers — the elements of array *a* ( - 10^{9} ≤ *a*_{i} ≤ 10^{9}).

The third line contains *m* integers — the elements of array *b* ( - 10^{9} ≤ *b*_{j} ≤ 10^{9}).

Output

Print *m* integers, separated by spaces: the *j*-th of which is equal to the number of such elements in array *a* that are less than or equal to the value *b*_{j}.

Examples

Input

5 4

1 3 5 7 9

6 4 2 8

Output

3 2 1 4

Input

5 5

1 2 1 2 5

3 1 4 1 5

Output

4 2 4 2 5

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/29/2017 14:12:27 (c2).

Desktop version, switch to mobile version.
User lists

Name |
---|