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

bool compare(const pair<int,string>& a, const pair<int,string>& b){
    if(a.first!=b.first) return a.first < b.first;
    else return a.second > b.second;
}

int main(){
    int n,no,m,s;
    string in;
    map<string,int> mp;
    vector< pair<int,string> > vp;
    cin >> n;
    while(cin >> no >> m >> s){
        for(int i=0;i<m;i++){
            cin >> in;
            mp[in]+=s;
        }
    }
    for(map<string,int>::iterator iter=mp.begin();iter!=mp.end();iter++) vp.push_back(make_pair(iter->second,iter->first));
    sort(vp.begin(),vp.end(),compare);
    for(int i=vp.size()-1;i>=0;i--){
        cout << vp[i].second << ' ' << vp[i].first << endl;
        if(vp.size()-i==10) break;
    }

    return 0;
}