119 - Greedy Gift Givers

//Author: Fuadul Hasan(fuadul202@gmail.com)
//BSMRSTU,Gopalganj
#include<bits/stdc++.h>
using namespace std;int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding  cin.tie(0);
#define pb  push_back
#define mp make_pair
#define ll long long
#define pr pair<int, int> 
#define vpr vector<pr> 
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(),n.end()
#define Test printf("Case %d: ",tc++);
#define YES printf("YES\n");
#define NO printf("NO\n");
#define Yes printf("Yes\n");
#define No printf("No\n");
const int mod = 1e9 + 7;
const ll  Inf = (ll)2e18 + 5;
const int N   = 2e5 + 5;

int solve() 
{
	//happy coding
	/*size_t t = 1;
    size_t n;*/
    int t = 1;
    int n;
	//cin>>n;
	std::map<string, int> m;
	while(cin>>n){
	m.clear();
	string zz[n+1];
	string s,z;
	for(int i=0;i<n;i++){
		//string s;
		cin>>s;
		zz[i] = s;
		//m[s] = 0;
	}
	//string s,z;
	int p,d;
	for(int i=0;i<n;i++){
		cin>>s>>d>>p;
		if(p==0) continue;
		m[s] = (m[s] - d);
			m[s]+=(d%p);
			int g = d/p;
			for(int j=0;j<p;j++){
				//string z;
				cin>>z;
				m[z] += g;
			}
	}
	if(t++>1) cout<<endl;

		for(int i=0;i<n;i++){
			cout<<zz[i]<<" "<<m[zz[i]]<<endl;
		}
	}

	return 0;
}
int main(){
	int test = 1;
	//scanf("%d", &test);
	while (test--)solve();return 0;
}