#include<bits/stdc++.h>
using namespace std;
int m,n,arr[1000086],k;
int cha(int x){
	int mid=m/2,l=1,r=m;
	while(mid!=1 && mid!=m){
		if(arr[mid]==x){
			return mid;
		}
		if(arr[mid]>x){
			r=mid;
			mid--;
			mid=(mid+l)/2;
		}
		if(arr[mid]<x){
			l=mid;
			mid++;
			mid=(mid+r)/2;
		}
	}
	return -1;
}
int main(){
	cin>>m>>n;
	for(int i=1;i<=m;i++) cin>>arr[i];
	for(int i=0;i<n;i++){
		cin>>k;
		cout<<cha(k)<<" ";
	}
	return 0;
}