#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<map>
using namespace std;
int n;
map<string,int>M;
main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int m,s;cin>>m>>m>>s;
		string t;
		for(int j=0;j<m;j++)
		{
			cin>>t;
			M[t]+=s;
		}
	}
	vector<pair<int,string> >P;
	for(map<string,int>::iterator it=M.begin();it!=M.end();it++)
	{
		P.push_back(make_pair(-(*it).second,(*it).first));
	}
	sort(P.begin(),P.end());
	for(int i=0;i<(P.size()<10?P.size():10);i++)cout<<P[i].second<<" "<<-P[i].first<<endl;
}