#include <fstream>
#include <queue>
using namespace std;
ifstream f("interclasari.in");
ofstream g("interclasari.out");
priority_queue <int> Q;
bool vect[1000005];
int main()
{
    int k,sol=0,n,x,m=0,maax=-1;
    f>>k;
    for(int i=1;i<=k;i++)
    {
        f>>n;
        sol+=n;
        for(int j=1;j<=n;j++)
        {
            f>>x;
            if(x>maax)
                maax=x;
            Q.push(x);

        }

    }
    g<<sol<<"\n";
    while(!Q.empty())
    {
        vect[Q.top()]=1;
        Q.pop();
    }
    for(int i=0;i<=maax;i++)
        if(vect[i]==1)
            g<<i<<" ";
    return 0;
}