#include <bits/stdc++.h>

using namespace std;

priority_queue <int> q;
int n;

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

    int w, k, x;
    int cnt = 0;
    fin >> w;
    while(w)
    {
        w--;
        fin >> k;
        cnt += k;
        for(int i = 1; i <= k; i++)
        {
            fin >> x;
            q.push(-x);
        }
    }

    fout << cnt << "\n";
    while(!q.empty())
    {
        fout << -q.top() << " ";
        q.pop();
    }

    return 0;
}