#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n;
    cin >> n;
    map<string, int> mp;
    REP(i,n){
        int m, x;
        cin >> m;
        cin >> m >> x;
        while (m--){
            string s;
            cin >> s;
            mp[s] -= x;
        }
    }
    vector<pair<int, string> > v;
    for (pair<string, int> p : mp){
        v.push_back(make_pair(p.second, p.first));
    }
    sort(ALL(v));
    int x = 0;
    for (pair<int, string> p : v){
        cout << p.second << " " << -p.first << endl;
        x++;
        if (x == 10) break;
    }
    return 0;
}