#include <bits/stdc++.h>

using namespace std;

int binsearch(vector<int>& a, int x)
{
    int n = a.size();
    int l = -1, r = n;
    while (r - l > 1)
    {
        int mid = (l + r) / 2;
        if (a[mid] >= x)
        {
            r = mid;
        }
        else
        {
            l = mid;
        }
    }
    return r;
}

int main()
{
    int n,m;
    cin >> n >> m;
    vector<int>a;
    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        a.push_back(x);
    }
    for (int i = 0; i < m; i++)
    {
        int x;
        cin >> x;

        int res = binsearch(a, x);

        cout << (res < n && a[res] == x ? res : -1) << "\n";
    }
}