#include using namespace std; #define INF_LL (int64)1e18 #define INF (int32)1e9 #define REP(i, n) for(int64 i = 0;i < (n);i++) #define FOR(i, a, b) for(int64 i = (a);i < (b);i++) #define all(x) x.begin(),x.end() #define fs first #define sc second using int32 = int_fast32_t; using uint32 = uint_fast32_t; using int64 = int_fast64_t; using uint64 = uint_fast64_t; using PII = pair; using PLL = pair; const double eps = 1e-10; templateinline void chmin(A &a, B b){if(a > b) a = b;} templateinline void chmax(A &a, B b){if(a < b) a = b;} template vector make_v(size_t a){return vector(a);} template auto make_v(size_t a,Ts... ts){ return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value!=0>::type fill_v(U &u,const V... v){u=U(v...);} template typename enable_if::value==0>::type fill_v(U &u,const V... v){ for(auto &e:u) fill_v(e,v...); } using T = tuple; int main(void) { vector res; int64 n; cin >> n; vector> v(n); int64 mx = 0; REP(i, n) { int64 m; cin >> m; v[i].resize(m); REP(j, m) cin >> v[i][j]; chmax(mx, m); } REP(i, mx) { REP(j, n) { if (v[j].size() > i) { res.push_back(v[j][i]); } } } REP(i, res.size()) { cout << res[i] << " "; } cout << endl; }