#include <bits/stdc++.h>
using namespace std;
const int MN = 200005;
int N, M;
int A[MN];
int main() {
  scanf("%d %d", &N, &M);
  for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
  sort(A + 1, A + 1 + N);
  while (M--) {
    int X, Sol = 0;
    scanf("%d", &X);
    for (int it = 1 << 18; it; it /= 2)
      if (Sol + it <= N && A[Sol + it] <= X) Sol += it;
    printf("%d ", Sol);
  }
  return 0;
}
