#include <cstdio>
#include <cstdlib>
#include <stack>
#include <algorithm>
using namespace std;
const int MAXN = 500;
int val[MAXN + 1];
int main() {
	int n, k, position, query;
	scanf("%d%d", &n, &k);
	for (int i = 0;i < n;i++) {
		scanf("%d", &val[i + 1]);
	}
	for (int i = 0;i < k;i++) {
		scanf("%d", &query);
		val[0] = query;
		position = n;
		while (val[position] != query) position--;
		printf("%d ", position - 1);
	}
	puts("");
	return 0;
}
/**************************************************************
	Problem: 2167
	User: admin
	Language: C++
	Result: Accepted
	Time:9 ms
	Memory:1148 kb
****************************************************************/