#include<bits/stdc++.h>
using namespace std;
int a[10000005];
int BinarySearch(int a[],int x,int n){
	int ans=-1;
	int l=1,r=n;
	while(l<=r){
		int mid=(l+r)/2;
		if(a[mid]==x){
			while(a[mid-1]==x){
				mid--;
			}
			ans=mid;
			break;
		}
		if(x<a[mid]){
			r=mid-1;
		}
		else
			l=mid+1;
	}
	return ans;
}
int main(){
	int n,k,m;
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=k;i++){
		cin>>m;
		int ans=BinarySearch(a,m,n);
		cout<<ans<<" ";
	}
	return 0;
}