#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <functional>

#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P = pair<int, int>;

template <class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}
template <class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}
struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} SETUP;


signed main() {
    int n; cin >> n;
    map<string, int> mp;
    rep(i, 0, n) {
        int no; cin >> no;
        int tag_n, point; cin >> tag_n >> point;
        rep(j, 0, tag_n) {
            string tag; cin >> tag;
            mp[tag] += point;
        }
    }

    vector<pair<string, int>> as;
    for (auto p : mp) {
        as.push_back(p);
    }
    sort(as.begin(), as.end(), [](pair<string, int> x, pair<string, int> y){ 
        if (x.second == y.second) {
            return x.first < y.first;
        }
        else {
            return x.second > y.second;
        }
    });
    int len = min<int>(10, as.size());
    rep(i, 0, len) {
        auto p = as[i];
        cout << p.first << " " << p.second << endl;
    }
}