#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<vector>
#include<queue>
using namespace std;
#define mem(a,t) memset(a,t,sizeof(a))
#define LL long long
const int inf=0x1f1f1f1f;
const int mod=1000000007;
#define N 100005
struct node
{
    int x,id;
}a[N],b[N];
int ans[N];
bool cmp1(node a,node b)
{
    if(a.x!=b.x)
        return a.x<b.x;
    return a.id<b.id;
}

void fun(int n,int m)
{
    int i,j=0;
    for(i=0;i<m;i++)
    {
        while(a[j].x<b[i].x)
        {
            j++;
        }
        if(a[j].x==b[i].x&&j<n)
        {
            ans[b[i].id]=a[j].id;
            j++;
        }
        else
            ans[b[i].id]=-1;
    }
}
int main()
{
    int i,j,n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i].x);
            a[i].id=i+1;
        }
        sort(a,a+n,cmp1);

        for(i=0;i<m;i++)
        {
            scanf("%d",&b[i].x);
            b[i].id=i+1;
        }
        sort(b,b+m,cmp1);
        fun(n,m);
        for(i=1;i<=m;i++)
            printf("%d\n",ans[i]);

    }
    return 0;
}