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

(CodeForces - 600B)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

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

题目大意：对于b数组的每一个元素b[i]，问在a数组中有多少个人小于等于b[i]。

思路：显然二分查找，用STL中的upper_bound(first,end,val)函数会方便很多。

#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn=200005;
int a[maxn],b[maxn];

int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0;i<n;i++) scanf("%d",a+i);
        for(int i=0;i<m;i++) scanf("%d",b+i);
        sort(a,a+n);
        int ans;
        for(int i=0;i<m;i++)
        {
            if(i==m-1)
            {
                ans=upper_bound(a,a+n,b[i])-a;
                printf("%d\n",ans);
            }
            else
            {
                ans=upper_bound(a,a+n,b[i])-a;
                printf("%d ",ans);
            }
        }
    }
    return 0;
}