#include <iostream>
#include <algorithm>
#include <vector>
#include <tuple>
using namespace std;
int main(void) {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int N, P, A;
	cin >> N;
	//<順番、レジ番号、お客様番号>
	vector<tuple<int, int, int> > customer;
	for (int i = 0; i < N; ++i) {
		cin >> P;
		for (int j = 0; j < P; ++j) {
			cin >> A;
			customer.push_back({ j,i,A });
		}
	}
	sort(customer.begin(), customer.end());
	for (int i = 0; i < customer.size(); ++i) {
		if (i == customer.size() - 1)
			cout << get<2>(customer[i]) << endl;
		else
			cout << get<2>(customer[i]) << " ";
	}
	return 0;
}