#include<bits/stdc++.h>
using namespace std;
int binarySearch(int *arr, int n, int x){
  int lo=0,hi=n-1;
  int mid, res = -1;
  bool find = false;
  int ant = -1;
  while(lo<=hi){
    mid = (lo +hi)/2;
    //cout<<arr[mid]<<endl;
    if(arr[mid]<=x){
      res = mid;
      lo = mid + 1;
    }
    else
      hi = mid - 1;

  }
  return res;
}
int main(){
  int n,m;
  cin>>n>>m;
  int arr[n];
  for(int i=0;i<n;i++){
    cin>>arr[i];
  }
  sort(arr, arr+n);
  for(int i=0;i<m;i++){
    int current, count = 0;
    cin>>current;
    int index = binarySearch(arr,n,current);
    index++;
    cout<<index<<" ";
  }
  return 0;
}