#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

void sol(){
    ll n,k;cin>>n>>k;
    ll c=2e18;
    for(int i=0;i<k;i++){
        ll x;cin>>x;
        c=min(x,c);
    }
    set<string>st;
    map<string,int>mp;
    vector<pair<string,ll>>s(n);
    int cnt=0;
    vector<ll>a[n+1];
    for(int i=0;i<n;i++){
        cin>>s[i].second>>s[i].first;
        st.emplace(s[i].first);
        if(!mp.count(s[i].first))    mp[s[i].first]=++cnt;
        a[mp[s[i].first]].push_back(s[i].second);
    }
    for(auto it:st){
        sort(a[mp[it]].begin(),a[mp[it]].end());
    }
    for(int i=0;i<n;i++){
        ll ans=0;
        for(auto it:st){
            auto cnt=upper_bound(a[mp[it]].begin(),a[mp[it]].end(),s[i].second)-a[mp[it]].begin();
            ll cnt1=a[mp[it]].size()-cnt;
            if(it==s[i].first)  ans+=min(c-1,cnt1);
            else ans+=min(c,cnt1);
        }
        cout<<ans+1<<'\n';
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    sol();
    return 0;
}