#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#include<climits>
#include<set>
#include<utility>
using namespace std;
typedef long long int ll;

int main()
{
    map<string, int> mp;
    int N, t, point, M;
    cin >> N;
    for(int k=0; k<N; k++){
      cin >> M >> t >> point;
			for(int i=0; i<t; i++){
				string str;
        cin >> str;
        mp[str]+=point;
			}
		}

    vector<pair<int, string>> vec;

    for(auto x : mp)
        vec.push_back({-x.second, x.first});
    
    sort(vec.begin(), vec.end());
    
    int cnt = min(10, (int)vec.size());
		
		for(int i=0; i<cnt; i++){
			cout << vec[i].second << " " << -vec[i].first << endl;
			}

    return 0;
}