#include <bits/stdc++.h>

using namespace std;
ifstream fin("interclasari.in");
ofstream fout("interclasari.out");
priority_queue <int>q;
int k;
int n;
int main()
{
    int s=0,x,i;
    fin>>k;
    for(i=1;i<=k;i++)
    {
        fin>>n;
        s+=n;
        for(int i=1;i<=n;i++)
        {
            fin>>x;
            q.push(-x);
        }
    }
    fout<<s<<"\n";
    while(!q.empty())
        fout<<-q.top()<<" ",
        q.pop();
    return 0;
}