#include<bits/stdc++.h>
using namespace  std;
int a[100000];
int	finnd(int qWq,int x){
	for(int i=0;i<=x;i++){
		if(a[i]==qWq)
			return i;
	}
}
int judge(int k,int qwq){
	int mid=1,pos=0,tail=qwq;
	while(pos<=tail){
		mid=(pos+tail)/2;
		if(a[mid]==k) return a[mid];
		if(a[mid]<k) pos=mid+1;
		if(a[mid]>k) tail=mid-1;
	}
	return -1;
}
int main(){
	int n,m,x;
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=m;i++){
		cin>>x;
		if(judge(x,n)==-1){
			cout<<-1;
			break;
		}
		cout<<finnd(x,n)<<" ";
	}
	return 0;
}