#include <fstream>
#include <queue>
#define in "interclasari.in"
#define out "interclasari.out"

using namespace std;

ifstream fin(in);
ofstream fout(out);

priority_queue<int> q;

int K,n,x;

int main()
{

    int cnt = 0;

    fin>>K;

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

        for(int j=1; j<=n; ++j)
        {
            fin>>x;
            q.push(-x);
        }
    }

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

    return 0;
}