#include <bits/stdc++.h>

const int N = 1e5 + 5;
int n, k;

struct Node
{
    int val, id;
    std::string s;
} a[N];

bool cmp(const Node &x, const Node &y)
{
    return x.val > y.val;
}

int main()
{
    std::cin >> n >> k;
    int minc = std::numeric_limits<int>::max();
    for (int i = 1, c; i <= k; ++i)
    {
        std::cin >> c;
        if (c < minc)
            minc = c;
    }
    std::unordered_map<std::string, int> cnt;
    for (int i = 1; i <= n; ++i)
    {
        std::cin >> a[i].val >> a[i].s;
        a[i].id = i;
        cnt[a[i].s] = 0;
    }
    std::sort(a + 1, a + 1 + n, cmp);
    std::vector<int> ans(n + 1);
    for (int i = 1; i <= n; ++i)
    {
        int rk = 1;
        for (auto [name, v] : cnt)
        {
            rk += std::min(minc, v);
            if (name == a[i].s && v >= minc)
                rk--;
        }
        ans[a[i].id] = rk;
        cnt[a[i].s]++;
    }
    for (int i = 1; i <= n; ++i)
    {
        std::cout << ans[i] << '\n';
    }

    return 0;
}