Problem Statement

Gyopuro Supermarket has $N$ checkout registers with automatic payment machines and 1 register where payment is handled by hand.
The $N$ registers are numbered from $1$ to $N$.
However, one day the payment system was suddenly hacked and became unusable.
Since the automatic payment machines can no longer be used, it was decided to guide all customers to line up in a single line at the register where payment is handled by hand.
The guidance is carried out according to the following rules.

1. Operation: for a given register, guide the customer at the front of its line to the end of the line at the register where payment is handled by hand. As a result, the second customer becomes the front.
2. The operation is performed in ascending order of register number. After register number $N$ is done, it returns to 1 again.
3. The above is repeated until all customers have finished moving.

Input

$N$
$P$$1$ $A$$1,1$ $A$$1,2$$\dots A$$1,p$$1$
$P$$2$ $A$$2,1$ $A$$2,2$$\dots A$$2,p$$2$
$\dots$
$P$$N$ $A$$N,1$ $A$$N,2$$\dots A$$N,p$$N$

$1\le N \le 10$^$3$
$0$ $\le$ $P_i$ $\le$ $10$^$2$
$1$ $\le$ $A$_$i,j$$\le 10$^$5$
When $(i,j) \neq (ii,jj)$, $A$_$i,j$$\neq$$A$_$ii,jj$
At least one $A$_$i,j$ exists

Output

Output the order of the customers, from the front, after all customers have finished moving to the register where payment is handled by hand, separated by spaces.
Print a newline at the end.

Sample

3
3 1 2 3
2 4 5
1 6

1 4 6 2 5 3

5
3 1 2 3
0
1 4
2 5 6
0

1 4 5 2 6 3