/*
有序
1 2 3 3 3 4 4 4 5 5 5 5
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
int n,a[N],q;
int main(){
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=q;i++){
		int x;
		cin>>x;
		int l=1,r=n;
		int ans = -1;
		while(l<=r){
			int mid = (l+r)/2;
			if(a[mid]<x){
				l = mid+1;
			}
			else if(a[mid]==x){
				ans = mid;
				r = mid-1;
			}
			else if(a[mid]>x){
				r = mid-1;
			}
		}
		cout<<ans<<" ";
	}
	return 0;
}