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

bool cmp(int a, int b)
{
    return a > b;
}

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);
    }
    for (int i = 0; i < n; i++)
    {
        cin >> vv[i] >> tp[i];
        mp[tp[i]].push_back(vv[i]);
    }
    /*for (auto it : mp)
    {
        cout << it.first;
        sort(it.second.begin(), it.second.end(), cmp);
        for (auto j : it.second)
        {
            cout << j;
        }
        cout << "\n";
    }
    for (auto it : mp)
    {
        cout << it.first;
        for (auto j : it.second)
        {
            cout << j;
        }
        cout << "\n";
    }*/

    for (int i = 0; i < n; i++)
    {
        int ans = 1;
        for (auto it : mp)
        {
            sort(it.second.begin(), it.second.end(), cmp);
            int cot = mig;
            if (it.first == tp[i])
                cot--;
            for (auto j : it.second)
            {
                if(cot--<=0)
                    break;
                //cout << it.first << " " << j << " ";
                
                if (j > vv[i])
                    ans++;
                else
                    break;
            }
        }
        cout << ans << "\n";
    }
}