#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int NMAX = 2000000;

int n, k, p;
int heap[NMAX + 5];

void hinsert(int x)
{
    heap[++k] = x; p = k;
    while (p > 1 && heap[p] < heap[p >> 1])
    {
        swap(heap[p], heap[p >> 1]);
        p >>= 1;
    }
}

void heapsort()
{
    for (int i = 1; i <= n; ++i)
    {
        printf("%d ", heap[1]);
        heap[1] = heap[k];
        --k; p = 1;

        while ((p << 1) <= k)
        {
            int st = (p << 1);
            int dr = st + 1;
            int best = st;

            if (dr <= k && heap[st] > heap[dr])
                best = dr;
            if (heap[p] > heap[best])
                swap(heap[p], heap[best]);
            else
                break;
            p = best;
        }
    }
}

int main()
{
    freopen("interclasari.in", "r", stdin);
    freopen("interclasari.out", "w", stdout);

    int m; scanf("%d", &m);
    for (int i = 1; i <= m; ++i)
    {
        int ni; scanf("%d", &ni); n += ni;
        for (int i = 1; i <= ni; ++i)
        {
            int x;
            scanf("%d", &x);
            hinsert(x);
        }
    }
    printf("%d\n", n);
    heapsort();
    return 0;
}