#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
using namespace std;

int main()
{
	map<string, int>m;

	int N; cin >> N;
	for (int i = 0; i < N; i++) {
		int no; cin >> no;
		int M, S; cin >> M >> S;
		for (int j = 0; j < M; j++) {
			string t; cin >> t;
			m[t] += S;
		}
	}

	vector<pair<int, string>>s;
	for (auto p : m) {
		s.push_back(make_pair(10000-p.second, p.first));
	}
	sort(s.begin(), s.end());

	for (int i = 0; i < min(10,(int)s.size()); i++) {
		cout << s[i].second << " " << 10000 - s[i].first << endl;
	}

    return 0;
}