#include <bits/stdc++.h>

using namespace std;

int a[1000010];

int find(int n){
	int l = 1, r = n;
	while(l <= r){
		int mid = (l + r) / 2;
		if(a[mid] == n) return mid;
		else if(a[mid] > n) r = mid - 1;
		else l = mid + 1;
	}
	return -1;
}

int main(){
	int n, m;
	cin >> n >> m;
	for(int i = 1;i <= n;i++){
		cin >> a[i];
	}
	for(int i = 1;i <= m;i++){
		int k;
		cin >> k;
		cout << find(k) << " ";
	}
	return 0;
}

全部RE，求助~~~