#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
////
//#include <random>//
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin>>N;
	map<string,int> memo;
	vector<string> word;
	while(N--){
		int no,M,S;
		cin>>no>>M>>S;
		while(M--){
			string str;
			cin>>str;
			if( memo.find(str) != memo.end() ){
				memo[str]-=S;
			}else{
				memo[str]-=S;
				word.push_back( str );
			}
		}
	}
	sort(word.begin(),word.end());
	map<string,int>::iterator itr,end;
	itr = memo.begin();
	end = memo.end();
	vector< vector<int> > list;
	for(;itr!=end;++itr){
		vector<int> temp(2);
		temp[0] = itr->second;
		temp[1] = lower_bound(word.begin(),word.end(),itr->first)-word.begin();
		list.push_back( temp );
	}
	sort(list.begin(),list.end());
	int size = list.size();
	for(int i=0;i<size && i<10;++i){
		cout << word[list[i][1]] << " " << -list[i][0] << endl;
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()