Mikhail Tikhomirov

You are given an integer $n$ and a number of non-empty sets of elements from $0$ to $n-1$.

Construct a permutation $p$ of length $n$, such that for every given set $S$ the following holds: $\max\_{s \in S} p\_s - \min\_{s \in S} p\_s = |S| - 1\text{.}$

The solution is guaranteed to exist. If there are multiple solutions output any.

The first line contains two integers $n$ and $m$ ($3 \leq n \leq 100, 1 \leq m \leq 100$), length of the permutation and the number of sets.

$m$ lines follow. $i$-th of them contains an integer $k\_i$ ($2 \leq k\_i < n$) followed by $k\_i$ integers $a\_{i,j}$ ($0 \leq a\_{i,j} < n, a\_{i,j}\<a\_{i,j+1}$), size of the $i$-th set and its elements themselves.

It is guaranteed that the given sets are pairwise distinct and the answer exists.

Print $n$ integers. $i$-th of them should be equal to $p\_i$.