#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
priority_queue <int> q;
int n,i,x,k,j,sum,y;
int main()
{
    freopen("interclasari.in","r",stdin);
    freopen("interclasari.out","w",stdout);
    scanf("%d",&k);
    for(i=1;i<=k;i++)
    {
        scanf("%d",&x);
        sum+=x;
        for(j=1;j<=x;j++)
            scanf("%d",&y),q.push(-y);
    }
    printf("%d\n",sum);
    while(!q.empty())
    {
        printf("%d ",-q.top());
        q.pop();
    }
    return 0;
}