#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<math.h>

using namespace std;

#define INF 1000000007
#define LINF (1LL << 62)

typedef long long i64;
typedef pair<i64,i64> P;


int n, m[1010];
queue<int> a[1010];

int main(){
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> m[i];
		for(int j = 0; j < m[i]; j++){
			int c;
			cin >> c;
			a[i].push(c);
		}
	}
	for(int j = 0; j < 101; j++){
		for(int i = 0; i < n; i++){
			if(a[i].empty()) continue;
			cout << a[i].front() << " ";
			a[i].pop();
		}
	}
	cout << endl;
	
	return 0;
}