#include<iostream>
using namespace std;
int a[100005];

int find(int n,int f)
{
	int l=1,r=n;
	while(l<=r)
	{
		int mid=l+r>>1;
		if(a[mid]>=f)
			r=mid;
		else
			l=mid+1;
	}
	if(a[l]==f)
		return l;
	else
		return -1;
}

int main()
{
	int n,m;
	while(cin>>n>>m)
	{
		for(int i=1;i<=n;i++)
			cin>>a[i];
		while(m--)
		{
			int f;
			cin>>f;
			cout<<find(n,f)<<" ";
		}
		cout<<endl;
	}
}