#include <bits/stdc++.h>

using namespace std;

priority_queue<int>q;

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

int main()
{
    int k,cnt=0,l,x;
    fin>>k;
    for(int i=1;i<=k;i++)
    {
        fin>>l;
        cnt+=l;
        for(int j=1;j<=l;j++)
        {
            fin>>x;
            q.push(-x);
        }
    }
    fout<<cnt<<"\n";
    while(!q.empty())
    {
        fout<<-q.top()<<" ";
        q.pop();
    }

    return 0;
}