#include <assert.h>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

using ll = long long;
using P = std::pair<ll, ll>;

template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << "[" << pa.first << ", " << pa.second << "]";
}

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  os << "{";
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
  os << "}";
  return os;
}

#define rep(i, a, b) for (ll(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cerr << "debug " << i << std::endl

// const ll MOD = 998244353;
const ll MOD = 1e9 + 7;

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  ll n,max=0;
  std::cin>>n;

  std::vector<ll> p(n),now(n),ans;
  std::vector<std::vector<ll>> a(n);

  rep(i,0,n){
    std::cin>>p[i];
    now[i]=p[i];
    max=std::max(max,p[i]);
    rep(j,0,p[i]){
      ll temp;
      std::cin>>temp;
      a[i].push_back(temp);
    }
  }

  rep(_,0,max){
    rep(i,0,n){
    if(now[i]>0){
      ans.push_back(a[i][p[i]-now[i]]);
      now[i]--;
    }
    } 
  }

  rep(i,0,ans.size()){
    std::cout<<ans[i];
    std::cout<<((i!=ans.size()-1)?" ":"\n");
  }

  return 0;
}