#include <cstdio>
#include <cstdlib>
#include <stack>
#include <algorithm>
using namespace std;
const int MAXN = 1000;
int val[MAXN];
int main() {
	int n, k, query, l, r, mid;
	scanf("%d%d", &n, &k);
	for (int i = 0;i < n;i++) {
		scanf("%d", &val[i]);
	}
	for (int i = 0;i < k;i++) {
		scanf("%d", &query);
		l = 0;
		r = n;
		while (l < r) {
			mid = (l + r) / 2;
			if (val[mid] < query)
				l = mid + 1;
			else
				r = mid;
		}
		if (val[l] == query)
			printf("%d ", l);
		else
			printf("-1 ");
	}
	puts("");
	return 0;
}
/**************************************************************
	Problem: 2168
	User: admin
	Language: C++
	Result: Accepted
	Time:9 ms
	Memory:1148 kb
****************************************************************/