#include <stdio.h>
const int MAXN = 1000;

int main() {
        int a[MAXN];
        int n, k, query, l, r, mid;
        scanf("%d%d", &n, &k);
        for (int i = 0;i < n;i++) {
                scanf("%d", &a[i]);
        }
        for (int i = 0;i < k;i++) {
                scanf("%d", &query);
                l = 0;
                r = n;
                while (l < r) {
                        mid = (l + r) / 2;
                        if (a[mid] < query)
                                l = mid + 1;
                        else
                                r = mid;
                }
                if (a[l] == query)
                        printf("%d ", l);
                else
                        printf("-1 ");
        }
        puts("");
        return 0;
}
/**************************************************************
	Problem: 2168
	User: admin
	Language: C
	Result: Accepted
	Time:11 ms
	Memory:1144 kb
****************************************************************/