#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int main(){
  int n;
  cin>>n;
  map<string,int> cnt;
  while(n--){
    int m,s;
    cin>>m;
    cin>>m>>s;
    while(m--){
      string x;
      cin>>x;
      cnt[x] += s;
    }
  }
  vector<string> v;
  for(auto P : cnt){
    v.push_back(P.first);
  }
  sort(ALL(v), [&](string a,string b){
    if(cnt[a] != cnt[b])return cnt[a] > cnt[b];
    return a < b;
  });
  n = min(10, (int)v.size());
  REP(i,n)cout<<v[i]<<" "<<cnt[v[i]]<<endl;
  return 0;
}