B - Queries about less or equal elements CodeForces - 600B （STL 水题）

B - Queries about less or equal elements CodeForces - 600B 

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

题目大意：求ai>=bj的个数

直接把a从小到大排序，用upper_bound找到第一个大于bj的ai的位置

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#define loopa(i,a,b,d) for(int i=a;i<b;i+=d)
#define loops(i,a,b,d) for(int i=a;i>b;i-=d)
typedef long long LL;
using namespace std;
const int maxn=2*100000+1;
int a[maxn],b[maxn];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        loopa(i,0,n,1)scanf("%d",&a[i]);
        loopa(i,0,m,1)scanf("%d",&b[i]);
        sort(a,a+n);
        loopa(i,0,m,1)
        {
            if(i)printf(" ");
            printf("%d",upper_bound(a,a+n,b[i])-a);
        }
    }
    return 0;
}