#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n;
    cin>>n;
    vector<vector<int>> v(n,vector<int>(200));
    rep(i,n){
        int x;
        cin>>x;
        rep(j,x)cin>>v[i][j];
    }
    bool first=true;
    rep(j,200)rep(i,n){
        if(v[i][j]){
            if(!first)cout<<" ";
            first=false;
            cout<<v[i][j];
        }
    }
    cout<<endl;
    return 0;
}