#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

vector<int> v[20];
int index[20];

int main()
{
    ifstream f("interclasari.in");
    ofstream g("interclasari.out");
    int n, ni, s = 0;

    f >> n;
    for(int i = 0; i < n; ++i)
    {
        f >> ni;
        s += ni;
        v[i].resize(ni);
        for(int j = 0; j < ni; ++j)
            f >> v[i][j];
    }

    for(int i = 1; i <= s; ++i)
    {
        int mi = 1<<30, p;
        for(int j = 0; j < n; ++j)
            if(index[j] < v[j].size() && v[j][index[j]] < mi)
            {
                p = j;
                mi = v[j][index[j]];
            }
        g << v[p][index[p]] << ' ';
        ++index[p];
    }

    return 0;
}