#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    map<string, ll> ms;
    rep(i, n) {
        ll no, m, s;
        cin >> no >> m >> s;
        rep(j, m) {
            string tag;
            cin >> tag;
            ms[tag] += s;
        }
    }
    vector<pair<ll, string>> vp;
    for(auto x : ms) vp.push_back(make_pair(x.second, x.first));
    sort(all(vp), [](const pair<ll, string> &a, const pair<ll, string> &b){
        if (a.first == b.first) {
            return a.second < b.second;
        }
        return a.first > b.first;
    });
    rep(i, min(10LL, sz(vp))) printf("%s %lld\n", vp[i].second.c_str(), vp[i].first);
    return 0;
}