RT

#include<iostream>
using namespace std;
int m , n , q , a[1000010];
int find(int x){
	int l = 1 , r = n + 1;
	while (l < r){
		int mid = l + (r - 1) / 2;
		if (a[mid] > x){
			r = mid;
		}
		else{
			l = mid + 1;
		}
	}
	if (a[l] == x){
		return l;
	}
	else{
		return -1;
	}
}
int main(){
	cin >> n >> m;
	for (int i = 1 ; i <= n ; i ++){
		cin >> a[i];
	}
	for (int i = 0 ; i < m ; i ++){
		cin >> q;
		cout << find(q) << " ";
	}
	return 0;
}