#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e9;

int main()
{
    ll n, k, c, x = inf;
    cin >> n >> k;
    vector<string> sch(n + 1);
    vector<ll> gp, w(n + 1, 0), bl(n + 1, 0);
    map<string, vector<ll>> s;
    for (int i = 1; i <= k; i++)
        cin >> c, x = min(x, c);
    for (int i = 1; i <= n; i++)
    {
        cin >> w[i] >> sch[i];
        s[sch[i]].push_back(w[i]);
    }
    for (auto p : s)
        sort((p.second).begin(), (p.second).end(), greater<ll>());
    for (auto p : s)
        for (int j = 0; j < (p.second).size() && j < x; j++)
            gp.push_back((p.second)[j]);
    sort(gp.begin(), gp.end());
    for (int i = 1; i <= n; i++)
    {
        ll rk = gp.size() - (upper_bound(gp.begin(), gp.end(), w[i]) - gp.begin()) + 1;
        if (s[sch[i]].size() > x && w[i] < s[sch[i]][x - 1])
            rk--;
        cout << rk << '\n';
    }
    return 0;
}