#include <iostream>
#include <unordered_map>

using namespace std;

struct MyHash {
	// OpenJDK 7のhash()
	size_t operator()(long long val) const {
		val ^= (val >> 20) ^ (val >> 12);
		return val ^ (val >> 7) ^ (val >> 4);
	}
};

int main() {
	int n, m;
	unordered_map<long long, int, MyHash> cnt;

	cin >> n >> m;
	while (n--) {
		long long a;
		cin >> a;
		cnt[a]++;
	}
	while (m--) {
		long long b;
		cin >> b;
		cout << cnt[b] << " \n"[!m];
	}

	return 0;
}