#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define REP(i,a,n) for(int i = (a);i < (n);i++)
#define PI 3.14159265359
#define MOD 1000000007
#define chmax(a,b) if(a < b)a = b

using namespace std;

int main(){
    int n;
    cin >> n;
    map<string,int> tags;
    REP(i, 0, n){
        int no,m,s;
        cin >> no >> m >> s;
        REP(j, 0, m){
            string tag;
            cin >> tag;
            tags[tag] += s;
        }
    }
    vector<pair<int,string>> ans;
    for(pair<string,int> s:tags){
        ans.push_back({-s.second,s.first});
    }
    sort(ALL(ans));
    int N = ans.size() > 10 ? 10 : ans.size();
    for(int i = 0;i < N;i++){
        cout << ans[i].second << " " << -ans[i].first << endl;
    }
    return 0;
}