#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M;
    cin >> N >> M;

    vector<long long> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    sort(A.begin(), A.end());

    vector<int> result(M);
    for (int i = 0; i < M; ++i) {
        long long B;
        cin >> B;
        auto lower = lower_bound(A.begin(), A.end(), B);
        auto upper = upper_bound(A.begin(), A.end(), B);
        result[i] = upper - lower;
    }

    for (int i = 0; i < M; ++i) {
        if (i > 0) cout << ' ';
        cout << result[i];
    }
    cout << endl;

    return 0;
}