#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

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

    int n;
    cin >> n;

    map<string, int> mp;
    string t;
    for (int i = 0; i < n; i++) {
        int j;
        cin >> j;

        int m, s;
        cin >> m >> s;

        for (int k = 0; k < m; k++) {
            cin >> t;
            mp[t] += s;
        }
    }

    vector<pair<string, int>> a(n);
    for (const auto& p : mp) {
        a.push_back(p);
    }

    sort(a.begin(), a.end(), [](const pair<string, int>& p0, const pair<string, int>& p1) {
        return p0.second != p1.second ? p0.second > p1.second : p0.first < p1.first;
    });

    for (int i = 0; i < min(10, (int)a.size()); i++) {
        if (a[i].first.empty()) continue;
        cout << a[i].first << ' ' << a[i].second << '\n';
    }

    return 0;
}