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 sa, sb, num, pos1, pos2;
  vector<int> a, b, aux;
  map<int, int> M;
  cin >> sa >> sb;
  for (int i = 0; i < sa; i++) {
    cin >> num;
    a.push_back(num);
  }
  for (int i = 0; i < sb; i++) {
    cin >> num;
    b.push_back(num);
  }
  aux = b;
  sort(a.begin(), a.end());
  sort(aux.begin(), aux.end());
  vector<int>::iterator it = a.begin(), it2 = aux.begin();
  pos1 = 1;
  pos2 = 1;
  while (it2 != aux.end()) {
    if (*it <= *it2 && it != a.end()) {
      it++;
      pos1++;
    } else {
      M[*it2] = pos1 - 1;
      it2++;
    }
  }
  for (int i = 0; i < sb; i++) {
    cout << M[b[i]] << " ";
  }
  cout << endl;
}
