#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <climits>
#include <map>
#include <queue>
#include <cmath>

using namespace std;

using int64 = long long;

int main() {
    int n;
    cin >> n;
    vector<vector<int>> a(n);

    for (int i=0; i<n; i++) {
        int p;
        cin >> p;
        for (int j=0; j<p; j++) {
            int ai;
            cin >> ai;
            a[i].push_back(ai);
        }

        reverse(a[i].begin(), a[i].end());
    }

    bool f = true;
    while(f) {
        f = false;
        for (auto& ai : a) {
            if (ai.empty()) continue;
            f = true;
            cout << ai.back() << " ";
            ai.pop_back();
        }
    }
}