#include <bits/stdc++.h>
using namespace std;
const int N = 1e8;
int l, r, n, m, a[N], b, h;

int a1(int a[], int l, int r, int x) {
	if (l == r) {
		if (a[l] == x)
			return l;
		else
			return -1;
	}
	int m = (l + r) / 2;
	if (x <= a[m]) {
		a1(a, l, m, x);
	} else {
		a1(a, m + 1, r, x);
	}
}

int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> b;
		cout << a1(a, 1, n, b) << " ";
	}
	return 0;
}