#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
using namespace std;

map<string,int> m;

int N;

int main()
{
    cin >> N;

    int No;
    int M;
    int S;
    string temp;

    for(int i = 0;i < N;i++)
    {
        cin >> No;
        cin >> M;
        cin >> S;

        for(int i = 0;i < M;i++)
        {
            cin >> temp;
            if(m.find(temp) == m.end())
            {
                m[temp] = S;
            }
            else
            {
                m[temp] += S;
            }
        }
    }

    for(int i = 0;i < 10 && !m.empty();i++)
    {
        int MaxValu = -1;
        string key;
        for(auto ite = m.begin();ite != m.end();ite++)
        {
            if(MaxValu < (*ite).second)
            {
                MaxValu = (*ite).second;
                key = (*ite).first;
            }
        }

        cout << key << " " << MaxValu << endl;
        m.erase(key);
    }
    return 0;
}