#include <bits/stdc++.h>
#define int long long
#define iosy ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
const int inf = 0x3f3f3f3f3f3f3f3fLL;
struct node{
	int w;string s;int r;
};

bool cmp(node a,node b){
	return a.w>b.w;
}
void solve(){
	int n,k;cin>>n>>k;
	vector<int> c(k+1);
	int c1=inf;
	for(int i=1;i<=k;i++){
		cin>>c[i];
		c1=min(c1,c[i]);
	}
	map<string,vector<int>> mp;
	vector<node> a(n+1);
	vector<int> b(n+1);
	for(int i=1;i<=n;i++){
		cin>>a[i].w>>a[i].s;
		b[i]=a[i].w;
		mp[a[i].s].push_back(a[i].w);
	}
	//排序校内排名
	for(auto &[x,y]:mp){
		sort(y.begin(),y.end());
	}
	// for(auto [x,y]:mp){
	// 	cout<<x<<" ";
	// 	for(auto x1:y){
	// 		cout<<x1<<" ";
	// 	}
	// 	cout<<"\n";
	// }
	// cout<<"\n";
	//预处理校内排名
	for(int i=1;i<=n;i++){
		int w=a[i].w;string s=a[i].s;
		vector<int> t=mp[s];
		int p=lower_bound(t.begin(),t.end(),w)-t.begin();
		a[i].r=t.size()-p;
	}
	//排序总排名
	sort(a.begin()+1,a.end(),cmp);
	// for(int i=1;i<=n;i++){
	// 	cout<<a[i].w<<" "<<a[i].s<<" "<<a[i].r<<"\n";
	// }
	//遍历计算
	map<int,int> ans;
	int sum=0;
	for(int i=1;i<=n;i++){
		int w=a[i].w,rank=a[i].r;
		sum+=max((int)0,(min(c1,rank)-(rank-1)));//计算有误
		//cout<<"sum="<<sum<<"\n";
		ans[w]=sum;
	}
	for(int i=1;i<=n;i++){
		cout<<ans[b[i]]<<"\n";
	}
}	

signed main()
{
	iosy;
	int _t=1;
	//cin>>_t;
	while(_t--){
		solve();
	}
	return 0;
}