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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

int main() {
    int n;
    cin >> n;
    vector<vector<int>> a(n);
    vector<P> b;
    for (int i = 0;i < n;++i) {
        int p;
        cin >> p;
        a[i].resize(p);
        for (int j = 0;j < p;++j) {
            cin >> a[i][j];
            b.push_back(P(j,i));
        }
    }
    sort(b.begin(),b.end());
    for (P& p : b) cout << a[p.second][p.first] << " \n"[p == b.back()];
    return 0;
}