#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define fi first
#define se second
template<typename T> inline T min(vector<T>& v) {return *min_element(v.begin(), v.end());}
template<typename T> inline T max(vector<T>& v) {return *max_element(v.begin(), v.end());}
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
int main() {
	int n; cin >> n;
	int no, m, s;
	string tag;
	map<string, int> score;
	rep(i, 0, n) {
		cin >> no >> m >> s;
		rep(j, 0, m) {
			cin >> tag;
			score[tag] += s;
		}
	}
	vector<pair<int, string>> ans;
	for (auto a: score) {
		ans.eb(mp(a.se, a.fi));
	}
	sort(all(ans), [](auto a, auto b){
		return (a.fi == b.fi) ? (a.se < b.se) : (a.fi > b.fi);});
	rep(i, 0, min(10, len(ans))) {
		print(ans[i].se, ans[i].fi);
	}
	return 0;
}