#include<bits/stdc++.h>
using namespace std;
struct pr{
	string tag;
	int p;
	bool operator<(const pr&oth)const{
		if(p==oth.p)return tag>oth.tag;
		return p<oth.p;
	}
};

int main(){
	int n; cin>>n;
	unordered_map<string,int>mp;
	for(int i=0;i<n;++i){
		int no,m,s; cin>>no>>m>>s;
		for(int j=0;j<m;++j){
			string tag; cin>>tag;
			mp[tag]+=s;
		}
	}
	priority_queue<pr>q;
	for(auto&&i:mp)q.push({i.first,i.second});
	int i=0;
	while(i<10&&q.size()){
		cout<<q.top().tag<<" "s<<q.top().p<<"\n"s;
		q.pop();
		++i;
	}
}