#include<stdio.h>

const int N = 1e6 + 5;
int n, m;
int q[N];

int main()
{
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d", &q[i]);
	while (m--)
	{
		int x;
		scanf("%d", &x);

		int l = 0, r = n - 1;
		while (l < r)
		{
			int mid = l + r>>1;
			if (q[mid] >= x) r = mid; 
			else l = mid + 1;
		}
		if (q[l] != x) printf("-1");
		else printf("%d ", l);
	}
	return 0;
}