#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e6 + 5;
int n,m,a[N];
int Binary_search(int a[],int l,int r,int num){
	while (l < r){
		int mid = l + r >> 1;
		if (num <= mid)
			r = mid;
		else
			l = mid + 1;
	}
	if (a[l] == num){
		int idx = 0;
		for (idx = l;a[idx] == num;idx--);
		return idx+1;
	}
	else
		return -1; 
}

int main(){
	scanf("%d%d",&n,&m);
	for (int i = 1;i <= n;i++)
		scanf("%d",&a[i]);
	int num = 0;
	while (m--){
		scanf("%d",&num);
		cout << Binary_search(a,1,n,num) << " ";
	}
	return 0;
}