CodeForces - 600B （STL基础题）

版权声明：仅供研究，转载请注明出处。 https://blog.csdn.net/CSUstudent007/article/details/82466252

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 athat 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

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

水题。

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
const int maxn = 2e5+5;
typedef long long ll;
ll a[maxn],b[maxn];
int main(){
	int m,n;
	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>>b[i];
		int c=upper_bound(a,a+n,b[i])-a;
		if(i==0){
			cout<<c;
		}
		else{
			cout<<" "<<c;
		}
	}
	return 0;
}