#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
using namespace std;
long long a[1000009],n,m,p;
int find(int x){
	int l=n,r=1;
	while(r<l){
		int mid=(l-1)/2+r;
		if(a[mid]>=x) l=mid;
		else r=mid+1;
	}
	if(a[r]==x) return r;
	else return -1;
}
int main(){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++){
    	scanf("%d",&a[i]);
    }
    for(int i=1;i<=m;i++){
    	scanf("%d",&p);
    	printf("%d ",find(p));
    }
    return 0;
}