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 w, k, l, r, m;
  cin >> w >> k;
  long a[w], c[k];
  for (int i = 0; i < w; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < k; i++) {
    cin >> c[i];
  }
  sort(a, a + w);
  for (int i = 0; i < k; i++) {
    l = 0;
    r = w - 1;
    while (r - l > 1) {
      m = (l + r) / 2;
      if (c[i] >= a[m])
        l = m;
      else
        r = m;
    }
    if (c[i] >= a[r])
      cout << r + 1 << " ";
    else if (c[i] < a[l])
      cout << 0 << " ";
    else
      cout << r << " ";
  }
}
