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() {
  long long int i, j, k, n, m, count, l, h, md, temp, fl;
  cin >> n >> m;
  long long int a[n], b[m];
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  for (i = 0; i < m; i++) {
    cin >> b[i];
  }
  for (i = 0; i < m; i++) {
    fl = 0;
    temp = b[i];
    count = 0;
    l = 0;
    h = n - 1;
    md = (l + h) / 2;
    while (l <= h) {
      if (a[md] <= temp && a[md + 1] > temp) {
        count = md + 1;
        break;
      } else if (a[md] <= temp) {
        l = md + 1;
      } else if (a[md] > temp) {
        h = md;
      }
      md = (l + h) / 2;
      if (md == 0) fl++;
      if (fl >= 2) break;
    }
    cout << count;
    if (i != (m - 1)) cout << " ";
  }
  cout << endl;
  return 0;
}
