#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cmath>
#include<cstring>
#include<algorithm>
const int maxn=1000000+10;
using namespace std;
vector<string>s;
map<string,int>sen,rec;
int main(){
	int i,j,k,m,n;
	cin>>n;
	for(i=1;i<=n;i++){
		string x;
		cin>>x;
		s.push_back(x);
	}
	for(i=1;i<=n;i++){
		string u,v;
		cin>>u>>m>>k;
		if(k==0)continue;
		for(j=1;j<=k;j++){
			cin>>v;
			sen[u]+=m/k;
			rec[v]+=m/k;
		}	
	}
	for(i=0;i<s.size();i++){
		string t=s[i];
		cout<<t<<" "<<rec[t]-sen[t]<<endl;
	}
	return 0;
}