#include<iostream>
#include<vector>
using namespace std;
int findx(vector<int> nums,int target,int n) {
	int low = 0, high = n;
	while (low <= high) {
		int mid = low + (high - low) / 2;
		if (nums[mid] >= target) {
			high = mid - 1;
		}
		else {
			low = mid + 1;
		}
	}
	if (low > n-1 || nums[low] != target) {
		return -1;
	}
	else {
		return low+1;
	}
}

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> nums(n);
	for (int i = 0; i < n; i++) {
		cin >> nums[i];
	}
	for (int i = 0; i < m; i++) {
		int x;
		cin >> x;
		cout << findx(nums,x,n) << " ";
	}
	return 0;
}