#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9,MOD = 1e9+7,ohara = 1e6;
const ll LINF = 1e18;
using namespace std;

#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl

ll n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m[ohara],h,w,x,y,sum=0,pos,no[ohara],s[ohara],cou=0;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),tag,ac[ohara];
bool fl;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);
      
    cin>>n;
    map<string,ll> mp;
    map<string,ll> out;
    map<string,ll> bag;
    pair<ll,string> ans[ohara];
    pair<string,ll> anss[ohara];
    rep(i,n){
        cin>>no[i]>>m[i]>>s[i];
        rep(j,m[i]){
            cin>>tag;
            ac[cnt++]=tag;
            mp[tag]+=s[i];
        }
    }
    rep(i,cnt){
        if(out[ac[i]]==1)continue;
        ans[cou++]=make_pair(mp[ac[i]],ac[i]);
        out[ac[i]]=1;
    }
    sort(ans,ans+cou);
    reverse(ans,ans+cou);
    ll wa=0;
    rep(i,cou){
        string co[ohara];
        ll co_cou=0;
        rrep(j,i,cou){
            if(ans[i].first!=ans[j].first){
                i=j-1;
                break;
            }
            co[co_cou++]=ans[j].second;
        }
        sort(co,co+co_cou);
        rep(j,co_cou){
            if(bag[co[j]]==1)continue;
            cout<<co[j]<<" "<<ans[i].first<<"\n";
            bag[co[j]]=1;
            wa++;
            if(wa>=10)break;
        }
      if(wa>=10)break;
    }
    return 0;
}