#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

vector<pair<int, string>> a;

struct Trie {
    static constexpr int M = 5, O = 'a';
    struct Node {
        int children[2];
        int count;
    };
    Trie() : nodes(1) {}
    void insert(const string& s, int c) {
        int k = 0;
        int n = s.size();
        for (int i = 0; i < n; i++) {
            int c = s[i] - O;
            for (int j = M - 1; j >= 0; j--) {
                int v = c >> j & 1;
                int& p = nodes[k].children[v];
                if (p == 0) {
                    k = p = nodes.size();
                    nodes.push_back(Node());
                    nodes[k].count = -1;
                } else {
                    k = p;
                }
            }
        }
        if (nodes[k].count < 0) nodes[k].count = 0;
        nodes[k].count += c;
    }
    void dfs(int k, int j, string& s) {
        int64_t d = s.size();

        if (nodes[k].count >= 0 && d > 0) {
            a.push_back({ nodes[k].count, s });
        }

        if (j == 0) s.push_back(0); else s.back() <<= 1;
        if (++j == M) s.back() += O, j = 0;

        for (int v = 0; v < 2; v++) {
            int k1 = nodes[k].children[v];
            if (k1 == 0) continue;

            if (v) s.back()++;
            int b = s.back(), n = s.size();
            dfs(k1, j, s);
            s.resize(n); s.back() = b;
        }
    }
    vector<Node> nodes;
};

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

    int n;
    cin >> n;

    Trie tr;
    string t;
    for (int i = 0; i < n; i++) {
        int j;
        cin >> j;

        int m, s;
        cin >> m >> s;

        for (int k = 0; k < m; k++) {
            cin >> t;
            tr.insert(t, s);
        }
    }

    string s;
    tr.dfs(0, 0, s);

    stable_sort(a.begin(), a.end(), [](const pair<int, string>& p0, const pair<int, string>& p1) {
        return p0.first > p1.first;
    });

    for (int i = 0; i < min(10, (int)a.size()); i++) {
        cout << a[i].second << ' ' << a[i].first << '\n';
    }

    return 0;
}