#include <fstream>
#include <cstdio>
#include <queue>
#include <functional>
using namespace std;
priority_queue <int,vector<int>,greater<int>> q;
int main()
{
    int i,k,j,n,x;
    //ifstream in("interclasari.in");
    //ofstream out("interclasari.out");
    //in>>k;
    freopen("interclasari.in","r",stdin);
    freopen("interclasari.out","w",stdout);
    scanf("%d",&k);
    for(i=1; i<=k; i++)
    {
        //in>>n;
        scanf("%d",&n);
        for(j=1; j<=n; j++)
        {
            //in>>x;
            scanf("%d",&x);
            q.push(x);
        }
    }
    //out<<q.size()<<endl;
    printf("%d\n",q.size());
    while(q.size())
    {
        //out<<q.top()<<" ";
        printf("%d ",q.top());
        q.pop();
    }

    return 0;
}