#include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
  Int n;
  cin>>n;
  map<string, Int> mp;
  for(Int i=0;i<n;i++){
    Int no,m,s;
    cin>>no>>m>>s;
    string t;
    for(Int j=0;j<m;j++){
      cin>>t;
      mp[t]+=s;
    }
  }
  using P = pair<Int, string>;
  priority_queue<P,vector<P>,greater<P> > pq;
  for(auto p:mp) pq.emplace(-p.second,p.first);
  Int x=10;
  while(!pq.empty()&&x--){
    P p=pq.top();pq.pop();
    cout<<p.second<<" "<<-p.first<<endl;
  }
  return 0;
}