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 bs(int *arr, int len, int x) {
  int m = len / 2;
  int r = len - 1;
  int l = 0;
  while (l <= r) {
    if (arr[m] <= x) {
      l = m + 1;
    } else {
      r = m - 1;
    }
    m = (l + r) / 2;
  }
  if (arr[m] <= x) {
    m += 1;
  }
  return m;
}
int main(void) {
  int a = 0;
  int b = 0;
  scanf("%d %d", &a, &b);
  int A[a];
  int B[b];
  for (int i = 0; i < a; i++) {
    scanf("%d", A + i);
  }
  for (int i = 0; i < b; i++) {
    scanf("%d", B + i);
  }
  sort(A, A + a);
  for (int i = 0; i < b; i++) {
    printf("%d ", bs(A, a, B[i]));
  }
  printf("\n");
  return 0;
}
