#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;

map<string, int> ma;

int main(void) {
	int n; cin >> n;
	rep(i, n) {
		int n0, m, s; cin >> n0 >> m >> s;
		rep(j, m) {
			string t; cin >> t;
			ma[t] += s;
		}
	}
	vector<pair<int, string>> v;
	for(auto u : ma) {
		v.pb(mp(-u.se, u.fi));
	}
	sort(all(v));
	rep(i, min(10, (int)v.size())) {
		cout << v[i].se << " " << -v[i].fi << endl;
	}
	return 0;
}