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

using lint = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<lint> xs(n);
    for (auto& x : xs) std::cin >> x;
    std::sort(xs.begin(), xs.end());

    while (m--) {
        lint y;
        std::cin >> y;
        std::cout << std::upper_bound(xs.begin(), xs.end(), y) -
                         std::lower_bound(xs.begin(), xs.end(), y)
                  << " ";
    }
    std::cout << " ";
}

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

    solve();

    return 0;
}