#include <bits/stdc++.h>
using namespace std;
const int mod1 = 1e9 + 7;
const int mod2 = 998244353;
const long long int inf = 1e18;
const double pi = 3.1415926535897932384626;
long long int mpow(long long int a, long long int b, long long int m) {
  long long int res = 1;
  while (b) {
    if (b % 2) res = res * a % m;
    a = a * a % m;
    b /= 2;
  }
  return res;
}
long long int inv(long long int a, long long int m) {
  return mpow(a, m - 2, m);
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int ncr(long long int n, long long int k) {
  if (n < k) return 0;
  long long int C[n + 1][k + 1];
  long long int i, j;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= min(i, k); j++) {
      if (j == 0 || j == i)
        C[i][j] = 1;
      else
        C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]);
    }
  }
  return C[n][k];
}
void solve() {
  long long int n, m;
  cin >> n >> m;
  long long int a[n], b[m];
  vector<long long int> x;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  for (int i = 0; i < m; i++) {
    cin >> b[i];
    x.push_back(upper_bound(a, a + n, b[i]) - a);
  }
  for (auto i : x) cout << i << " ";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  clock_t start, end;
  start = clock();
  solve();
  end = clock();
  double time_taken = double(end - start) / double(CLOCKS_PER_SEC);
  cerr << "\nExecution time : " << fixed << time_taken << setprecision(5)
       << " s \n";
  return 0;
}
