#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
int mysearch(int x);
long long r,n,m,a[10000001],q;
int main(){
    scanf("%lld %lld",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    for(int j=1;j<=m;j++){
        scanf("%lld",&q);
        r=mysearch(q);
        printf("%lld ",r);
    }
    return 0;
}
int mysearch(int x){
    int mid,low,high;
    low=1;high=n;
    while(low<=high){
        mid=(high+low)/2;
        if(a[mid]==x)return mid;
        else if(a[mid]<x)  low=mid+1;
        else if(a[mid]>x) high=mid-1;
    }
    return -1;
}