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
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  int ar[n], br[m], cr[m], gr[m];
  for (int i = 0; i < n; i++) cin >> ar[i];
  for (int i = 0; i < m; i++) {
    cin >> br[i];
    cr[i] = br[i];
    gr[i] = cr[i];
  }
  sort(ar, ar + n);
  sort(br, br + m);
  int cur = 0, i = 0, j = 0;
  while (i < m) {
    while (ar[j] <= br[i] && j < n) {
      cur++;
      j++;
    }
    br[i] = cur;
    i++;
  }
  map<int, int> ma;
  sort(cr, cr + m);
  for (int i = 0; i < m; i++) ma[cr[i]] = br[i];
  for (int i = 0; i < m; i++) cout << ma[gr[i]] << " ";
  cout << endl;
}
