#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
 
const ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false); 
  
  int n;
  cin >> n;
  int a[n][101]={};
  rep(i,n){
    int p;
    cin >> p;
    rep(j,p){
      int x;
      cin >> x;
      a[i][j]=x;
    }
  }
  vector<int>ans;
  rep(j,101){
    rep(i,n){
      if(a[i][j])ans.emplace_back(a[i][j]);
    }
  }
  rep(i,ans.size())cout<<ans[i]<<" ";
  cout << endl;
  return 0;
}