#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct PIC{
	int s;
	string tag;
	PIC(int _s,string _tag){
		s=_s;
		tag=_tag;
	}
};
bool Comp(PIC &l,PIC &r){
	if (l.s>r.s){
		return true;
	}else if (l.s==r.s){
		if (l.tag.compare(r.tag)<0){
			return true;
		}
	}
	return false;
}
int main(int argc, char* argv[])
{
	int N;
	cin>>N;
	int No;

	vector<PIC> myPIC;
	int i;
	int M,S;
	for (i=0;i<N;i++){
		cin>>No;
		cin>>M>>S;
		for (int j=0;j<M;j++){
			string t;
			cin>>t;
			bool bFound=false;
			for (int k=0;k<myPIC.size();k++){
				if (myPIC[k].tag.compare(t)==0){
					myPIC[k].s+=S;
					bFound=true;
					break;
				}
			}
			if (!bFound){
				myPIC.push_back(PIC(S,t));
			}
		}
	}
	sort(myPIC.begin(),myPIC.end(),Comp);
	for (i=0;i<myPIC.size();i++){
		cout<<myPIC[i].tag<<" "<<myPIC[i].s<<endl;
		if (i==9){
			break;
		}
	}
	return 0;
}