#include <unordered_map>
#include <vector>
#include <iostream>

int main() {
    int N, M;
    std::cin >> N >> M;
    std::vector<long long> A(N);
    for (int i = 0; i < N; ++i) {
        std::cin >> A[i];
    }
    std::unordered_map<long long, int> counts;
    for (long long a : A) {
        counts[a]++;
    }
    std::vector<long long> B(M);
    for (int i = 0; i < M; ++i) {
        std::cin >> B[i];
    }
    for (long long b : B) {
        auto it = counts.find(b);
        if (it != counts.end()) {
            std::cout << it->second << " ";
        } else {
            std::cout << 0 << " ";
        }
    }
    std::cout << std::endl;
    return 0;
}