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

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

struct Tag{
    string name;
    ll score;
    Tag(string n, ll s){
        name = n;
        score = s;
    }

    bool operator>(const Tag &another) const
    {
        if(score == another.score){
            // return name > another.name;
            return name < another.name;
        }else{
            return score > another.score;
        }
    }

    string ToString(){
        stringstream ss;
        ss << name << ' ' << score;
        return ss.str();
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    map<string, ll> mp;

    while(N--){
        ll id; cin >> id;
        ll num, score; cin >> num >> score;

        FOR(i, 0, num){
            string tag; cin >> tag;
            mp[tag] += score;
        }
    }

    vector<Tag> T;
    for(auto p : mp){
        T.push_back(Tag(p.first, p.second));
    }
    sort(ALL(T), greater<Tag>());

    ll count = 0;
    for(auto t : T){
        p(t.ToString());

        count++;
        if(count==10) return 0;
    }
    
    return 0;
}