#include<iostream>
#define N 1000001
#define M 100001
using namespace std;
int arr[N];
int brr[M];

int main()
{
	int n, m;
	int left, mid, right,k,flag=0;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	for (int j = 0; j < m; j++)
	{
		cin >> brr[j];
	}
	
	for (k = 0; k < m; k++)
	{
		left = 0; right = n - 1; int h;//h是用来查找第一次出现 的循环变量
		while (left < right)
		{
			mid = (left + right) / 2;
			if (arr[mid] == brr[k])
			{
				for ( h = mid;; h--)
				{
					if (arr[h] != arr[h - 1])
					{
						break;
					}
				}
				cout << h + 1 << " ";
				break;
			}
			else if (brr[k] > arr[mid])
			{
				left = mid + 1;
			}
			else
			{
				right = mid - 1;
			}

		}
		if (left >= right)
		{
			cout << "-1" << " ";
		}

	}
	

	return 0;
}