#include<iostream>
using namespace std;
const int maxn=1e6+10;
long long a[maxn];
int main(){
    int n,m;
    cin >> n >> m;
    int j = 1;
    for(int i = 0;i < n;i++){
        cin >> a[j];
        if(j==1||a[j]!=a[j-1]){
            j++;
        }
    }
    for(int i = 0;i < m;i++){
        int x;
        cin >> x;
        int l = 1,r=j-1;
        while(l<=r){
            int mid = l+(r-l)/2;
            if(a[mid]==x){
                cout << mid ;
                cout << " " ;
                break;
            }
            else if(a[mid]>x){
                r = mid-1;
            }
            else{
                l = mid+1;
            }
        }
        if(l>r){
                cout << -1 ;
        }
    }
    return 0;
}