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