#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	long long int n,m;
	long long int a[10000],b[10000],c[10000];
	cin>>n>>m;
	for (long long int i=1;i<=n;i++)
	{
		cin>>a[i];
		c[a[i]]++;
	}
	sort(a+1,a+1+n);
	for (long long int i=1;i<=m;i++)
	{
		cin>>b[i];
		if(c[b[i]]==0)
		{
			cout<<-1<<" ";  
			continue;
		}
		long long int left=1,right=a[n],mid;
		while (left<right-1)
		{
			mid=(left+right)/2;
			if (a[mid]>b[i]) right=mid;
			else left=mid;
		}
		cout<<left+1-c[a[left]]<<" ";
	}
	return 0;
}