#include<stdio.h>
#include<string.h>
#include<map>
#include<vector>
using namespace std;
#define maxn 111111
int h[maxn],q[maxn];
map<int,int> ma;
vector<int> ve[maxn];
int num[maxn];
int Scan()
{
    int res = 0, ch, flag = 0;

    if((ch = getchar()) == '-')                //判断正负
        flag = 1;

    else if(ch >= '0' && ch <= '9')            //得到完整的数
        res = ch - '0';
    while((ch = getchar()) >= '0' && ch <= '9' )
        res = res * 10 + ch - '0';

    return flag ? -res : res;
}
int main()
{
    int n, m;
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        memset(num,0,sizeof(num));
        ma.clear();
        int i;
        int flag = 1;
        for(i=0;i<maxn;i++) ve[i].clear();
        for(i=1;i<=n;i++)
        {
            int x;
            x=Scan();
            if(ma[x]==0) {ma[x] = flag;flag++;}
            ve[ma[x]].push_back(i);
            
        }
        for(i=0;i<m;i++)
        {
            int x;
            x = Scan();
            if(ma[x]==0) printf("-1\n");
            else
            {
                
                if(num[ma[x]]>ve[ma[x]].size()-1)
                {
                    printf("-1\n");
                }
                else
                {
                //    printf("%d\n",ma[x]);
                    printf("%d\n",ve[ma[x]][num[ma[x]]]);
                    num[ma[x]]++;
                }
            }
        }
    }
    return 0;
}