#include<bits/stdc++.h>
using namespace std;
int n,m,a[1000005],q;
int binary_search(int l,int r,int a[],int k){
	while(l<=r){
		int mid=(l+r)/2;
		if(a[mid]==k)
			return mid;
		else if(a[mid]>k)
			return binary_search(1,mid-1,a,k);
		else
			return binary_search(mid+1,n,a,k);
	}
	return -1;
}
signed 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",&q);
		printf("%d ",binary_search(1,n,a,q));
	}
}