#include <iostream>
#include <algorithm>

using namespace std;
int n,m,a[1000001],num[1000001];

int main(){
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		cin >> num[i];
	}
	for(int i=1;i<=m;i++){
		cin >> a[i]; 
		int post=lower_bound(num+1,num+n+1,a[i])-num;
		if(a[i]!=a[post]) cout << "-1" << " ";
		else cout << post << " ";
	}
	return 0; 
}