#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<ctime>
using namespace std;
int num[100001],dai[10000001];
int n,m,ask,ans;
int erfen(int ch)
{
	int l=1,r=n;
	while(l!=r)
	{
		int mid=(l+r)/2;
		
		if(num[mid]==ch)
		{
			if(num[mid-1]==ch)
				return mid-1;
			else
				return mid;
		}
		else
			if(num[mid]>ch)
				r=mid-1;
			else
				if(num[mid]<ch)
					l=mid+1;
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&num[i]);
		dai[num[i]]++;
	}
	for(int i=1;i<=m;i++)
	{
		scanf("%d",&ask);
		ans=0;
		if(dai[ask]==0)
			ans=-1;
		else
			ans=erfen(ask);
		printf("%d ",ans);
	}
	return 0;
}