CodeForces - 600BQueries 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.

Example

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

题目大意就是给你一个数组a和一个数组b，要你求b数组中每个元素不小于a中元素的个数

用upper_bound(),轻松解决

代码

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<algorithm>
#include<iomanip>
#include<stack>
#define INF 0x3f3f3f3f
using namespace std;
int num[200005];
int main()
{
    int n,m;
    int temp;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i = 0;i < n;i++)
          scanf("%d",&num[i]);
        sort(num,num+n);
        scanf("%d",&temp);
        printf("%d",upper_bound(num,num+n,temp)-num);
        for(int i = 1;i < m;i++){
            scanf("%d",&temp);
            printf(" %d",upper_bound(num,num+n,temp)-num);
        }
    }
    return 0;
}