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, m, i, mid, l, h;
  cin >> n >> m;
  long long 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++) {
    l = 0;
    h = n - 1;
    while (l <= h) {
      mid = (l + h) / 2;
      if (mid == 0 && b[i] < a[mid]) {
        cout << 0 << " ";
        break;
      } else if (mid == n - 1) {
        cout << n << " ";
        break;
      } else if (a[mid] == b[i] && a[mid + 1] > b[i]) {
        cout << mid + 1 << " ";
        break;
      } else if (a[mid] == b[i] && a[mid + 1] == b[i]) {
        l = mid + 1;
      } else if (a[mid] > b[i]) {
        h = mid - 1;
      } else if (a[mid] < b[i]) {
        if (a[mid + 1] > b[i]) {
          cout << mid + 1 << " ";
          break;
        } else {
          l = mid + 1;
        }
      }
    }
  }
  return 0;
}
