#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vector<int> A(N);
	int res = 0;
	map<string, int> mp;
	int a;
	int m, sc;
	//set<int> st;
	string S;
	for (int i = 0; i < N; i++) {
		cin >> a;
		cin >> m;
		cin >> sc;
		for (int j = 0; j < m; j++) {
			cin >> S;
			mp[S] += sc;
		}
	}
	vector<pair<int, string> > vp;
	for (auto m : mp) {
		vp.push_back(make_pair(-m.second, m.first));
	}
	sort(vp.begin(), vp.end());
	for (int i = 0; i < min((int)10, (int)vp.size()); i++) {
		cout << vp[i].second << " " << -vp[i].first << endl;
	}
}