#include<bits/stdc++.h>
using namespace std;
int search(int arr[], int left, int right, int key) {
	if (left > right)return -1;
	int mid = left + (right - left) / 2;
	if (key >arr[mid]) search(arr, mid + 1, right, key);
	else if (key <arr[mid]) search(arr, left, mid - 1, key);
	else return mid;
}
int main() {
	int n, m, arr[1000010];
	int q;
	int number;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)cin >> arr[i];
	for (int i = 1; i <= m; i++) {
		cin >> q;
		number = search(arr, 0, n, q);
		cout << number << " ";
	}
	return 0;
}