#include <bits/stdc++.h>


using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 998244353;


int a[1005][105];

int main() {
	REP(i, 1005)REP(j, 105)a[i][j] = INF;

	int n;
	cin >> n;
	REP(i, n) {
		int p;
		cin >> p;
		REP(j, p) {
			cin >> a[i][j];
		}
	}

	VI ans;

	REP(j, 105) {
		REP(i, 1005) {
			if (a[i][j] == INF);
			else ans.push_back(a[i][j]);
		}
	}
	REP(i, ans.size()) {
		cout << ans[i] << ' ';
	}
	cout << endl;
	

	
}