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, s, e, mi, q = 0, ind = -1;
  scanf("%d %d", &n, &m);
  int a[n], b[m];
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a, a + n);
  for (int i = 0; i < m; i++) {
    scanf("%d", &b[i]);
    s = 0;
    e = n - 1;
    mi;
    ind = -1;
    while (s <= e) {
      mi = (s + e) / 2;
      if (a[mi] <= b[i]) {
        ind = mi;
        s = mi + 1;
      } else {
        e = mi - 1;
      }
    }
    b[i] = ind + 1;
  }
  for (int i = 0; i < m; i++) {
    if (i == m - 1) {
      printf("%d\n", b[i]);
    } else {
      printf("%d ", b[i]);
    }
  }
}
