rt， 84pts

#include<bits/stdc++.h>

using namespace std;
const int N = 1000010;
int n, m;
int q[N];
int main(){
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) scanf ("%d", &q[i]);
    
    while(m--) {
        int x;
        scanf("%d", &x);
        
        int l = 0, r = n;
        while (l < r) {
            int mid = l + (r - l) / 2;
            if (q[mid] >= x) r = mid;
            else l = mid + 1;
        }
        
        if (q[l] == x) printf("%d ", l);
        else printf("-1 ");
    }
     
    return 0;
}