#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define se second
#define fi first
#define pb push_back
#define eb emplace_back

map<string,vector<int>> sc;

void solve()
{
	int n,k;
	cin>>n>>k;
	int c[k+1];
		//cout<<team<<'!'<<endl;

	for(int i=1;i<=k;i++) cin>>c[i];
	vector<pair<int,string>> vec;

	for(int i=1;i<=n;i++)
	{
		int num;
		string team;
		cin>>num>>team;
		sc[team].pb(num);
		vec.pb({num,team});
	}
	for(auto &z:sc)
	{
		sort(z.se.begin(),z.se.end());
	}

	for(auto tm:vec)
	{
		int num = tm.fi;
		string team = tm.se;


		int ans=1e14;
		for(int i=1;i<=k;i++)
		{
			int rk=1;
			int max_c = c[i];
			for(auto z:sc)
			{
				int js=0;
				if(z.fi==team) js=1;
				auto vx = z.se;
				int t = lower_bound(vx.begin(), vx.end(), num) - vx.begin();

				t = vx.size()-t;

				rk += min(t,max_c);	
				if(js) rk--;
			}


			ans=min(ans,rk);
		}

		cout<<ans<<endl;
	}

}
/*

2 4 8 16 32 64
31 -> 36

*/
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--) solve();
}