#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;

struct edge {
	int to, cost;
	edge(int t,int c):to(t),cost(c) {}
};
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};

//-----------------------------------------------------------------------------

typedef pair<int,string> Pis;

int n;
map<string,int> mp;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	REP(i,n) {
		//cout<<"i "<<i<<endl;
		int no,m,s;
		cin>>no>>m>>s;
		REP(i,m) {
			string tag;
			cin>>tag;
			mp[tag]+=s;
		}
	}
	priority_queue<Pis> pq;
	for(auto x:mp) pq.push(Pis(x.se,x.fi));
	int cnt=0;
	while (!pq.empty()&&cnt<10) {
		vector<string> v;
		Pis p=pq.top();pq.pop();
		v.pb(p.se);
		while(!pq.empty()&&pq.top().fi==p.fi) {
			v.pb(pq.top().se);pq.pop();
		}
		sort(ALL(v));
		for(auto x:v) {
			if(cnt==10) break;
			cout<<x<<' '<<mp[x]<<endl;
			cnt++;
		}
	}

	return 0;
}