#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    vector<vector<int32_t>> amat(n);
    int32_t m = 0;
    for (auto i = 0; i < n; ++i) {
        int32_t p;
        cin >> p;
        for (auto j = 0; j < p; ++j) {
            int32_t a;
            cin >> a;
            amat[i].push_back(a);
            ++m;
        }
        reverse(amat[i].begin(), amat[i].end());
    }
    while (m > 0) {
        for (auto i = 0; i < n; ++i) {
            if (amat[i].empty())
                continue;
            cout << amat[i].back() << (m == 1 ? '\n' : ' ');
            amat[i].pop_back();
            --m;
        }
    }
    return 0;
}