#include <bits/stdc++.h>

using namespace std;

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

priority_queue < int, vector < int >, greater < int > > A;

int main(){
    int t, n, x, sum;
    fin >> t;
    sum = 0;
    while(t--){
        fin >> n;
        sum += n;
        for(int i = 1; i <= n; i++){
            fin >> x;
            A.push(x);
        }
    }
    fout << sum << "\n";
    while(!A.empty()){
        fout << A.top() << " ";
        A.pop();
    }
    return 0;
}