#if !defined(__clang__) && defined(__GNUC__)
#include <bits/stdc++.h>
#else
#include <cstdlib>
#include <climits>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <regex>
#endif //  !defined(__clang__) && defined(__GNUG__)
#include <boost/lexical_cast.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/multi_array.hpp>
#include <boost/optional.hpp>
#include <boost/math/common_factor_rt.hpp>

using namespace std;

int main()
{
    int64_t N;
    std::cin >> N;

    struct Img {
        int64_t no;
        int64_t score;
        std::vector<std::string> tags;
    };

    std::vector<Img> imgs;
    for (decltype(N) i = 0; i < N; ++i) {
        Img t;
        int64_t m;
        std::cin >> t.no >> m >> t.score;

        for (int64_t j = 0; j < m; ++j) {
            std::string s;
            std::cin >> s;
            t.tags.push_back(s);
        }
        imgs.push_back(t);
    }

    std::map<std::string, int64_t> sum;

    for (auto& img: imgs) {
        for (auto& t: img.tags) {
            sum[t] += img.score;
        }
    }

    struct Tags {
        std::string tag;
        int64_t score;
    };

    std::vector<Tags> tags;
    for (auto& s: sum) {
        tags.push_back({s.first, s.second});
    }

    std::sort(std::begin(tags), std::end(tags),
              [](const auto& a, const auto& b) {
                  return a.score == b.score ? a.tag < b.tag : a.score > b.score;
              });

    for (size_t i = 0; i < std::min((size_t)10, tags.size()); ++i) {
        std::cout << tags[i].tag << " " << tags[i].score << std::endl;
    }

    return 0;
}