#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<unordered_map>
#include<vector>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
const int inf = 1e9 + 5;

int n, k, mi = inf, ans[N];
struct node {
	ll st, p;
	string s;
	bool operator<(node b) {
		return st > b.st;
	}
}e[N];
unordered_map<string, vector<ll>>ma;
unordered_map<string, int>slip;

signed main() {
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= k; ++i) {
		int x; scanf("%d", &x);
		mi = min(mi, x);
	}
	for (int i = 1; i <= n; ++i)
		cin >> e[i].st >> e[i].s, e[i].p = i;

	sort(e + 1, e + 1 + n);
	for (int i = 1; i <= n; ++i)
		ma[e[i].s].push_back(e[i].st);

	for (int i = 1; i <= n; ++i) {
		int rank = 1;
		for (auto it : ma) {
			int tmp = mi;
			string name = it.first;
			int& p = slip[name];
			if (e[i].s == name)tmp--;
			while (p < it.second.size() && it.second[p] > e[i].st)p++;
			if (p >= tmp)rank += tmp;
			else rank += p;
		}
		ans[e[i].p] = rank;
	}
	for (int i = 1; i <= n; ++i)printf("%d\n", ans[i]);
	return 0;
}