#include <bits/stdc++.h>
using namespace std;

ifstream fin ("interclasari.in");
ofstream fout ("interclasari.out");

vector <int> v;

int n, k, x;

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++) {
        fin >> k;
        for (int j = 1; j <= k; j++) {
            fin >> x;
            v.push_back(x);
        }
    }
    
    sort(v.begin(), v.end());
    
    for (int i = 0; i < v.size(); i++) {
        cout << v[i] << ' ';
    }
    
    return 0;
}