#include<bits/stdc++.h>
using namespace std;
const int N = 1000005, M = 1000005;
int n, m, a[N], b[M];

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

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