#include<iostream>
#include<algorithm>
using namespace std;
int key;
int a[10000];
int n;
int m;
bool cmp(int a,int b)
{
    return a<b;
}
int search()
{
    /*
    for(int ans=0;ans<n;ans++)
    {
        if(a[ans]==key)
        {
            return ans+1;
        }
    }
    return -1;
    */
    int l=1;
    int r=n;
    sort(a,a+m,cmp);
    while(l<=r)
    {
        int mid = (l+r)/2;
        if(key<=a[mid])
        {
            r=mid-1;
        }
        else
        {
            l=mid+1;
        }
    }
    if(l<=n) 
    {
        return l;
    }
    return -1;
}
int main()
{
    cin>>m>>n;
    for(int s=1;s<=m;s++)
    {
        cin>>a[s];
    }
    for(int s=1;s<=n;s++)
    {
        cin>>key;
        cout<<search()<<" ";
    }
}