#include <bits/stdc++.h>
using namespace std;
const int N = 1116;

#define int long long
int n,m;
int a[N];
int f(int k){
	int l=1,r=n;
	while(l<r){
		int mid=(l+r-1)/2;
		if(a[mid]>k){
			l=mid;
		} 
		else if(a[mid]>k){
			r=mid;
			
		}
		else 
			return mid;
		
		//TODO
	}
	return -1;
} 
signed main()
{
	cin>>n>>m;
	for(int i=0;i<=n;i++){
		cin>>a[i];
	}
	while(m--){
		int x;
		cin>>x;
		cout<<f(x);
	}
	
	return 0;
}