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

int main() {
  int n;
  cin >> n;
  map<string, int> mp;

  for (int i=0; i<n; i++) {
    int no, m, s;
    cin >> no >> m >> s;

    for (int j=0; j<m; j++) {
      string tag;
      cin >> tag;
      
      mp[tag]+=s;
    }
  }

  vector<pair<string, int>> pa;
  for (auto itr=mp.begin(); itr!=mp.end(); itr++) {
    pa.push_back(pair<string, int>(itr->first, itr->second));
  }

  sort(pa.begin(), pa.end(), [](auto &left, auto &right) {return left.second==right.second ? left.first<right.first: left.second>right.second;});

  int size=pa.size()>10 ? 10: pa.size();
  for (int i=0; i<size; i++) {
    cout << pa[i].first << " " << pa[i].second << endl;
  }
}