#include<bits/stdc++.h>
using namespace std;	
int n,m;
int mag(int x,int a[])
{
	int l=1;
	int r=n;
	while(l<=r){
		int mid=(l+r)/2;
		if(a[mid]==x) return mid;
		else if(x<a[mid]) r=mid-1;
		else l=mid+1;	
	}
	return -1;
}
int main()
{
	int ask;
	cin>>n>>m;
	int *a=new int[n+5];
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=m;i++){
		cin>>ask;
		cout<<mag(ask,a)<<endl;
	}
	
	
	
	
	
	
	
	
	
	delete[] a;
	return 0;
}