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

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A,size_t N,typename T>void Fill(A(&array)[N],const T &val){fill((T*)array, (T*)(array+N), val);}
const int inf = INT_MAX / 2; const ll INF = LLONG_MAX / 2;
//template end



int main(){
    int n; scanf("%d",&n);
    queue<int> task[1010]; int cnt=0;
    rep(i,0,n){
        int p; scanf("%d",&p); cnt+=p;
        rep(j,0,p){
            int q; scanf("%d",&q);
            task[i].push(q);
        }
    }
    int idx=0;
    while(cnt){
        if(task[idx%n].size()){
            printf("%d ",task[idx%n].front());
            task[idx%n].pop(); cnt--;
        }
        idx++;
    }
    return 0;
}