Codeforces-600B Queries about less or equal elements(二分)



You 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⁵) — the sizes of arrays a and b.

The second line contains n integers — the elements of array a ( - 10⁹ ≤ a_i ≤ 10⁹).

The third line contains m integers — the elements of array b ( - 10⁹ ≤ b_j ≤ 10⁹).

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

二分 需注意输出为0的情况.

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[200005];
int b[200005];
int i,m,n;
int f(int k,int l,int r)
{
    int mid;
    while (r-l>1)
    {
        mid=(r+l)/2;
        if (a[mid]>k)
        {
            r=mid;
        }
        else
        {
            l=mid;
        }
    }

     return l;

}
int main()
{

    scanf("%d%d",&m,&n);
    for (i=0;i<m;i++)
    {
        scanf("%d",&a[i]);

    }
    for (i=0;i<n;i++)
    {
        scanf("%d",&b[i]);
    }
    sort(a,a+m);
    for (i=0;i<n;i++)
    {
        if (b[i]>=a[m-1]) {printf("%d ",m); continue;}
        if (b[i]<a[0]) {printf("%d ",0); continue;}
        printf("%d ",f(b[i],0,m-1)+1);
    }

}