#include <bits/stdc++.h>
using namespace std;

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

    int n, m;
    cin >> n >> m;

    int bestContest = INT_MAX;
    vector<int> contestLimits(m);

    for (int i = 0; i < m; ++i) {
        cin >> contestLimits[i];
        bestContest = min(bestContest, contestLimits[i]);
    }

    unordered_map<string, vector<int>> teamMap;
    vector<pair<string, int>> teamInfo(n);

    for (int i = 0; i < n; ++i) {
        int curStrength;
        string curUni;
        cin >> curStrength >> curUni;

        auto& team = teamMap[curUni];
        team.insert(
            upper_bound(team.begin(), team.end(), curStrength, greater<>()),
            curStrength
        );

        teamInfo[i] = {curUni, curStrength};
    }

    for (const auto& [curUni, curStrength] : teamInfo) {
        int rank = 1;

        for (const auto& [uni, strengths] : teamMap) {
            int limit = min(bestContest, (int)strengths.size());
            
            // Binary search to find how many are stronger
            rank += lower_bound(strengths.begin(), strengths.begin() + limit, curStrength, greater<>()) - strengths.begin();
        }
        cout << rank << '\n';
    }

    return 0;
}