#include<iostream>
using namespace std;
int n,m,q;
int a[1000230];
int search(int x)
{
    int left=1,right=n;
    while(left<=right) 
    {
        int mid=(left+right)/2;
        if(a[mid]==x)return mid;
        if(a[mid]<x)left=mid+1;
        else right=mid;
    }
    return -1;
}
int main()
{
    cin>>n>>m;
    for(int i =1;i<=n;i++)
    {
        cin>>a[i];
    }
    while(m--)
    {
        cin>>q;
        search(q);
        cout<<" ";
    }
    return 0;
}