#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n;
vector<int> vec[1005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	int a, p;
	for(int i = 1; i <= n; i++){
		cin >> p;
		for(int j = 0; j < p; j++){
			cin >> a;
			vec[i].push_back(a);
		}
		reverse(vec[i].begin(), vec[i].end());
	}
	vector<int> ans; bool flag = true;
	while(flag){
		flag = false;
		for(int i = 1; i <= n; i++){
			if(vec[i].size() == 0) continue;
			flag = true;
			ans.push_back(vec[i].back());
			vec[i].pop_back();
		}
	}
	for(int i = 0; i < ans.size(); i++) cout << ans[i] << " "; cout << endl;
	return 0;
}