#include<bits/stdc++.h>     
using namespace std;
int a[2000005],o,len=1000000000,gett,summ,n,zuo=1,yo,mid;
int ls,ls2;
int main(){
    scanf("%d",&o);
    scanf("%d",&ls);
    for(int i=1;i<=o;i++){
        scanf("%d",&a[i]);
    }
    //scanf("%d",&gett);
    yo=o;
    for(int i=1;i<=ls;i++){
    	yo=o;
    	scanf("%d",&gett);
    	while(zuo<=yo){
	        mid=zuo+((yo-zuo)/2);
	        if(a[mid]>gett){
	            yo=mid-1;
	        }
	        else if(a[mid]<gett){
	            zuo=mid+1;
	        }
	        else{
	            len=min(len,mid);
	            yo--;
	        }
	    }
		if(len==1000000000)
	        cout<<-1;
	    else
	        cout<<len<<" ";
	    len=1000000000;
	}
}