#include <bits/stdc++.h>
using namespace std;
bool cmp(long long int a,long long int b)
{
	return a>b;
}
int main()
{
	int n,k;cin>>n>>k;
	set <int> xiao;
	for(int i=0;i<k;i++){long long int x;cin>>x;xiao.insert(x);}
	k=*xiao.begin();//cout<<k<<'\n';
	map < string , vector<long long int> > ma; 
	vector <long long int> dui,pai,pai2; 
	map <long long int,int> book,ans;
	for(int i=0;i<n;i++)
	{
		string s;long long int x;cin>>x>>s;
		ma[s].push_back(x);
		dui.push_back(x);
	}
	for(auto &it:ma)
	{
		sort(it.second.begin(),it.second.end(),cmp);
	}
	for(auto &it:ma)
	{
		for(int i=0;i<it.second.size();i++)
		{
			if(i+1<=k) 
			{
			    pai.push_back(it.second[i]);
			    book[it.second[i]]=1;
		    }
		}
	}
	sort(pai.begin(),pai.end(),cmp);
	for(int i=0;i<pai.size();i++)
	{
		ans[pai[i]]=i+1;
		//cout<<pai[i]<<"**"<<'\n';
	}
	for(int i=pai.size()-1;i>=0;i--)
	{
		pai2.push_back(pai[i]);
	}
	for(int i=0;i<dui.size();i++)
	{
		if(book[dui[i]]==1) cout<<ans[dui[i]];
		else
		{
			int ans=lower_bound(pai2.begin(),pai2.end(),dui[i])-pai2.begin();
			if(ans!=0) cout<<ans;
			else cout<<pai2.size();
		}
		cout<<'\n';
	}
	return 0;
}