#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 10;
int a[MAX];
int main(){
	int n,m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	while(m--){
		int x;
		cin >> x;
		int ans = lower_bound(a + 1,a + n + 1,x) - a;
		if(x != a[ans]){
			cout << "-1";
		} else {
			cout << ans << " ";
		}
	}
	return 0;
}