#include <vector>
#include <algorithm>
#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::sort(A.begin(), A.end());

    std::vector<long long> B(M);
    for (int i = 0; i < M; ++i) {
        std::cin >> B[i];
    }

    for (int i = 0; i < M; ++i) {
        long long target = B[i];
        auto lower = std::lower_bound(A.begin(), A.end(), target);
        auto upper = std::upper_bound(A.begin(), A.end(), target);
        int count = upper - lower;
        std::cout << count << ' ';
    }

    std::cout << '\n';

    return 0;
}