#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
pair<string, int> mp[N];
int vv[N];
string tp[N];

bool cmp(pair<string, int> a, pair<string, int> b)
{
    return a.second > b.second;
}

int main()
{
    int n, m;
    cin >> n >> m;
    int mig = 0x3f3f3f3f;
    for (int i = 0; i < m; i++)
    {
        int x;
        cin >> x;
        mig = min(mig, x);
    }
    map<string, int> mp;
    vector<array<int, 3>> team(n);
    for (int i = 0; i < n; i++)
    {
        int w;
        string s;
        cin >> w >> s;
        if (mp.count(s) == 0)
        {
            mp[s] = m++;
        }
        team[i] = {w, mp[s], i};
    }

    sort(team.begin(), team.end());
    vector<int> cnt(m);
    for (auto [c, i, id] : team)
        cnt[i]++;

    int rank = 0;
    for (int i = 0; i < m; i++)
    {
        rank = rank + min(cnt[i], mig);
    }

    vector<int> ans(n);
    for (int i = 0; i < n; i++)
    {
        auto [c, j, id] = team[i];
        ans[id] = rank;
        rank = rank - min(mig, cnt[j]);
        cnt[j] = cnt[j] - 1;
        rank = rank + min(mig, cnt[j]);
    }

    for (int i = 0; i < n; i++)
        cout << ans[i] << "\n";
}