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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int m, n;
  cin >> m >> n;
  vector<int> a(m);
  for (int i = 0; i < m; ++i) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  for (int i = 0; i < n; ++i) {
    int t;
    cin >> t;
    if (t < a[0]) {
      cout << 0 << " ";
      continue;
    }
    if (t >= a[m - 1]) {
      cout << m << " ";
      continue;
    }
    int left = 0;
    int right = m - 1;
    int x = (left + right) / 2;
    while (right - left > 1) {
      x = (left + right) / 2;
      if (t >= a[x]) {
        left = x;
      } else {
        right = x;
      }
    }
    cout << (t >= a[right] ? right : left) + 1 << " ";
  }
  return 0;
}
