N variables X₁, ..., X_N can have positive integer values. You are given K constraints for these value that look like "the values of variables X_i₁, X_i₂, ..., X_{i_M} are different". Among all possible lists of values of these variables that satisfy these constraints select the ones which have minimum possible max(X_i). Output lexicographically least of these lists.

Input

The first line of input contains two integers n and k (2 ≤ N ≤ 10, 1 ≤ K ≤ 100) — the number of variables and the number of constraints.

The following K lines contain the constraints, formatted as follows: the first number in the line M (2 ≤ M ≤ N) gives the number of variables in the constraint. After it follow M space-separated integers i₁, ..., i_M — the indices of the variables used in the constraint (1 ≤ i_j ≤ N). All i_j in one constraint are different.

Output

Output the values of X₁, X₂, ..., X_N in a single line, separated with single spaces.

Different variables

Examples