#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}


int main()
{

    int Q;
    Q = 1;
    cin >> Q;
    vector<string>p;
    map<string, ll>mp;
    while (Q--) {
        int a;
        cin >> a;
        int b, c;
        cin >> b >> c;
        vector<string>t(b);
        for (int i = 0; i < b; i++) {
            
            cin >> t[i];
            mp[t[i]] += c;
            p.push_back(t[i]);
        }
        

    }
    sort(p.begin(), p.end());
    vector<pair<int, string>>r;
    for (int i = 0; i < p.size(); i++) {
        if (mp[p[i]] >= 0)r.push_back({ -1*mp[p[i]],p[i] });
        mp[p[i]] = -1;
    }
    sort(r.begin(), r.end());
    int w = r.size();
    for (int i = 0; i < min(w, 10); i++)cout << r[i].second << " " << -1*r[i].first << endl;

    return 0;
}