#include <bits/stdc++.h>

using namespace std;

ifstream fin ("interclasari.in");
ofstream fout ("interclasari.out");

priority_queue <int> q;
int lungime, k;

int main()
{
    int x, contor = 0;
    fin >> k;
    for(int i = 1; i <= k; i++)
    {
        fin >> lungime;
        contor += lungime;
        for(int j = 1; j <= lungime; j++)
        {
            fin >> x;
            /// (-x) pentru a fi puse in ordine crescatoare, nu descrescatoare.
            q.push(-x);
        }
    }

    /// Afisare:
    fout << contor << "\n";
    while (!q.empty())
    {
        /// Le afisam cu semnul lor initial:
        fout << -q.top() << " ";
        q.pop();
    }
    fin.close();
    fout.close();
    return 0;
}