#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>

void solve() {
    int n;
    std::cin >> n;

    std::map<std::string, int> score;
    while (n--) {
        int m, x;
        std::cin >> m >> m >> x;

        while (m--) {
            std::string s;
            std::cin >> s;

            if (!score.count(s)) score[s] = 0;
            score[s] += x;
        }
    }

    std::vector<std::pair<int, std::string>> ps;
    for (auto& p : score) {
        ps.emplace_back(-p.second, p.first);
    }

    std::sort(ps.begin(), ps.end());
    if (ps.size() > 10) ps.resize(10);

    for (auto p : ps) {
        std::cout << p.second << " " << -p.first << std::endl;
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}