#include <fstream>
#include <queue>

using namespace std;

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

priority_queue <int, vector <int> > pq;

int main(  ) {
    int t, sol= 0;
    fin>>t;
    for ( int cnt= 1; cnt<=t; ++cnt ) {
        int n;
        fin>>n;
        sol+= n;

        for ( int i= 1; i<=n; ++i ) {
            int x;
            fin>>x;

            pq.push(-x);
        }
    }

    fout<<sol<<"\n";
    for ( ; !pq.empty(); pq.pop() ) {
        fout<<-pq.top()<<" ";
    }

    fout<<"\n";

    return 0;
}