#include "bits/stdc++.h"
using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 2e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

class Cmp {
public:
	bool operator() (pis a, pis b) {
		if (a.first != b.first) {
			return a.first < b.first;
		}
		else {
			return a.second > b.second;
		}

	}
};


int main() {
	int n0;
	cin >> n0;
	set<string> st;
	map<string, int> mp;
	for (int unko = 0; unko < n0; unko++) {
		int n;
		cin >> n;
		int m, s;
		cin >> m >> s;
		for (int i = 0; i < m; i++) {
			string tag;
			cin >> tag;
			mp[tag] += s;
			st.insert(tag);
		}
	}
	priority_queue<pis, vector<pis>, Cmp> pq;
	for (auto itr = st.begin(); itr != st.end(); itr++) {
		string tag = *itr;
		int score = mp[tag];
		pq.push(make_pair(score, tag));
	}
	for (int i = 0; i < 10; i++) {
		auto a = pq.top();
		cout << a.second << " " << a.first << endl;
		pq.pop();
		if (pq.empty()) {
			return 0;
		}

	}
}