#define _USE_MATH_DEFINES
#include<iostream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<deque>
#include<map>
#include<set>
#define ll long long
#define dou(s) atof(s.c_str())
#define lon(s) atoll(s.c_str())
#define str(n) to_string(n)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(ll i=b;i>=a;i--)
#define ALL(a) a.begin(),a.end()
#define rALL(a) a.rbegin(),a.rend()
#define fion(n) fixed<<setprecision(n)
#define endl "\n"
#define OR ||
#define AND &&
#define NOT !
#define line(s) getline(cin,s)
#define MOD 1000000007ll
#define fdarst(a,n) (a[a.size()-1]>=n&&a[lower_bound(ALL(a),n)-a.begin()]==n?lower_bound(ALL(a),n)-a.begin():-1)
#define fist(s,t) ((int)s.find(t))
#define START int main(){cin.tie(0);ios::sync_with_stdio(false);
#define END }
using namespace std;
struct pea{ll n,m;};
void msort(vector<pea> &a,ll k=0){
  struct hikakukansu{
    static bool unstable(const pea &x,const pea &y){return x.m<y.m;}
    static bool stable(const pea &x,const pea &y){return (x.m==y.m?x.n<y.n:x.m<y.m);}
  };
  sort(ALL(a),(k==0?hikakukansu::unstable:hikakukansu::stable));
}
START
ll n,no,m,s;cin>>n;
map<string,ll> t;
string S;
vector<string> a;
rep(i,0,n){
	cin>>no>>m>>s;
	rep(j,0,m){
		cin>>S;
		if(t[S]==0)a.push_back(S);
		t[S]+=s;
	}
}
sort(rALL(a));
vector<pea> b;
rep(i,0,a.size())b.push_back({i,t[a[i]]});
msort(b,1);
if(b.size()>10){
	rrep(i,b.size()-1,b.size()-10)cout<<a[b[i].n]<<" "<<b[i].m<<endl;
}else{
	rrep(i,b.size()-1,0)cout<<a[b[i].n]<<" "<<b[i].m<<endl;
}
END