#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
#define NMAX 100001
using namespace std;
ifstream f("interclasari.in");
ofstream g("interclasari.out");

int main() {
    priority_queue<int , vector<int> , greater<int>>Q;
    int n;
    int contor =0 ;
    f>>n;
    while(n--)
    {
        int m;
        f>>m;
        contor+=m;
        for(int i=1;i<=m;i++)
        {
            int x;
            f>>x;
            Q.push(x);
        }
    }
    g<<contor<<'\n';
    while(!Q.empty())
    {
        g<<Q.top()<<" ";
        Q.pop();
    }
    return 0;
}