#include <bits/stdc++.h>

std::priority_queue < int > hp;

int main() {
    FILE *fin, *fout;
    int k, n, i, j, nr, m = 0;
    fin = fopen( "interclasari.in", "r" );
    fout = fopen( "interclasari.out", "w" );
    fscanf( fin, "%d", &k );
    for ( i = 0; i < k; i++ ) {
        fscanf( fin, "%d", &n );
        for ( j = 0; j < n; j++ ) {
            fscanf( fin, "%d", &nr );
            hp.push( -nr );
        }
        m += n;
    }
    fprintf( fout, "%d\n", m );
    while ( !hp.empty() ) {
        fprintf( fout, "%d ", -hp.top() );
        hp.pop();
    }
    fclose( fin );
    fclose( fout );
    return 0;
}