#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

map<string, int> _m;
vector<tuple<int, string> > v;

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

    int N;
    std::cin >> N;

    for(int i=0;i<N;++i){
        int No;
        std::cin >> No;

        int M, S;
        std::cin >> M >> S;

        for(int j=0;j<M;++j){
            string tag;
            std::cin >> tag;

            _m[tag] -= S;
        }
    }

    for(const auto& p : _m){
        v.emplace_back(snd(p), fst(p));
    }

    sort(v.begin(), v.end());

    for(int i=0;i<min<int>(v.size(), 10);++i){
        auto p = v[i];
        std::cout << snd(p) << " " << (-fst(p)) << std::endl;
    }
}