#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int NR = 1e6 + 5;
int n, m, x, a[NR];
int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    for(int i = 1; i <= m; i++)
    {
        scanf("%d", &x);
        if(binary_search(a + 1, a + n + 1, x))
        {
            int p = lower_bound(a + 1, a + n + 1, x) - a;
            printf("%d ", p);
        }
        else
            puts("-1 ");
    }
    return 0;
}