#include<bits/stdc++.h>
using namespace std;
const int maxn=10000005;
long long int a[maxn],b[maxn];
int search(long long aa[],int nn,int k){
	int l=1,r=nn;
	while(l<=r){
		int mid=(l+r)/2;
		if(aa[mid]==k){
			while(aa[mid]==k){
				mid--;
			}
			return mid+1;
		}
		if(aa[mid]>k){
			r=mid-1;
		}
		else{
			l=mid+1;
		}
	}
	return -1;
}
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=m;i++){
		cin>>b[i];
		int c=b[i];
		cout<<search(a,n,c)<<" ";
	}
	return 0;
}