B. Queries about less or equal elements

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 2·105) — the sizes of arrays a and b.

The second line contains n integers — the elements of array a ( - 109 ≤ ai ≤ 109).

The third line contains m integers — the elements of array b ( - 109 ≤ bj ≤ 109).

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 bj.

Examples

input

Copy

5 4
1 3 5 7 9
6 4 2 8

output

Copy

3 2 1 4

input

Copy

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

output

Copy

4 2 4 2 5

解题说明：此题是一道数学题，对数组排序后进行判断即可。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>

using namespace std;

int a[200002];

int main() 
{
	int n, m, x; 
	cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	sort(a, a + n);
	for (int i = 0; i<m; i++) 
	{
		cin >> x;
		cout << upper_bound(a, a + n, x) - a << " ";
	}
	return 0;
}