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 n, t, i, j, k, co, f, l, m, temp, flag;
  scanf("%lld %lld", &n, &t);
  long long a[n], b[t];
  for (i = 0; i < n; i++) scanf("%lld", &a[i]);
  for (i = 0; i < t; i++) scanf("%lld", &b[i]);
  sort(a, a + n);
  for (i = 0; i < t; i++) {
    flag = 0;
    temp = b[i];
    co = 0;
    f = 0;
    l = n - 1;
    m = (f + l) / 2;
    while (f <= l) {
      if ((a[m] <= temp && a[m + 1] > temp)) {
        co = m + 1;
        break;
      } else if (a[m] <= temp)
        f = m + 1;
      else if (a[m] > temp)
        l = m;
      m = (f + l) / 2;
      if (m == 0) flag++;
      if (flag > 1) break;
    }
    printf("%lld ", co);
    if (i == t - 1) printf("\n");
  }
  return 0;
}
