#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("interclasari.in");
ofstream cout("interclasari.out");
int n,k,x,t;
priority_queue<int,vector<int>,greater<int>>h;
int main()
{
    cin>>n;
    while(n--){
        cin>>k;
        t+=k;
        while(k--){
            cin>>x;
            h.push(x);
        }
    }
    cout<<t<<'\n';
    while(!h.empty()){
        cout<<h.top()<<" ";
        h.pop();
    }
    return 0;
}