#include <vector> 
#include <list> 
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << '=' << (x) << endl;
#define debug(x) cerr << #x << '=' << (x) << '('<<'L' << __LINE__ << ')' << ' ' << __FILE__ << endl;

int main() {

	typedef pair<string, int> P;
	vector<pair<string, int> > Tags;

	int N, No, M, S;
	string T;
	cin >> N;
	REP(i, N) {

		cin >> No;
		cin >> M >> S;
		REP(j, M) {
			cin >> T;
			
			int pos = -1;

			REP(i, SZ(Tags)) {
				if (Tags[i].first == T) {
					pos = i;
					break;
				}
			}

			if (pos != -1) {
				Tags[pos].second += S;
			}
			else {
				pair<string, int> tag(T, S);
				Tags.push_back(tag);
			}
		}

	}

	sort(ALL(Tags), [](P a, P b) { if (a.second != b.second) { return a.second > b.second; } else { return a.first < b.first; }  });

	REP(i, SZ(Tags)) {
		if (i >= 10) { break; }
		cout << Tags[i].first << " " << Tags[i].second << endl;
	}



}