#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m;
int a[100001];
int main()
{
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++)	scanf("%d", &a[i]);
	for (int i = 1; i <= m; i++)
	{
		int x;
		scanf("%d", &x);
		int l = 1, r = n;
		while (l <= r)
		{
			if (l == r)
			{
				if (x == a[l])	printf("%d ", l);
				else	printf("-1 ");
				break;
			}
			int mid = (l + r) >> 1;
			if (x <= a[mid])	r = mid;
			else	l = mid + 1;
		}
	}
	return 0;
}