#include<stdio.h>
#include<map>
#include<iostream>
#include<algorithm>
#include<vector>

struct E{
	int score;
	std::string tag;
	bool operator<(const E& e)const{
		if(score!=e.score)return score>e.score;
		return tag<e.tag;
	}
};

int main(){
	int n;
	scanf("%d",&n);
	std::map<std::string,int> sum;
	std::string str;
	for(int i=0;i<n;i++){
		int no;
		scanf("%d",&no);
		int m,s;
		scanf("%d %d",&m,&s);
		for(int j=0;j<m;j++){
			std::cin>>str;
			sum[str]+=s;
		}
	}
	E e;
	std::vector<E> vec;
	std::map<std::string,int>::iterator it;
	for(it=sum.begin();it!=sum.end();it++){
		e.score=(*it).second;
		e.tag=(*it).first;
		vec.push_back(e);
	}
	std::sort(vec.begin(),vec.end());
	for(int i=0;i<10&&i<vec.size();i++){
		std::cout<<vec[i].tag<<" "<<vec[i].score<<std::endl;
	}
}