#include<iostream>
using namespace std;
int n,m,a[1000010],b;
int find(int x){
    int l=1,r=n;
    while(l<=r){
        int mid=(l+r)/2;
        if(a[mid]==x){
            return mid;
        }
        else if(a[mid]>x){
            r=mid-1;
        }
        else{
            l=mid+1;
        }
    }
    return -1;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;++i){
        cin>>a[i];
    }
    for(int i=0;i<m;++i){
        cin>>b;
        cout<<find(b)<<" ";
    }
    return 0;
}