B'N variables X1, xe2 x80 x89..., xe2 x80 x89XN can have positive integer values. You are given K constraints for these value that look like "the values of variables Xi1, xe2 x80 x89Xi2, xe2 x80 x89..., xe2 x80 x89XiM are different". Among all possible lists of values of these variables that satisfy these constraints select the ones which have minimum possible max(Xi). Output lexicographically least of these lists. The first line of input contains two integers n and k (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89N xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89K xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89M xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89N) gives the number of variables in the constraint. After it follow M space-separated integers i1, xe2 x80 x89..., xe2 x80 x89iM -- the indices of the variables used in the constraint (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ij xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89N). All ij in one constraint are different. Output the values of X1, xe2 x80 x89X2, xe2 x80 x89..., xe2 x80 x89XN in a single line, separated with single spaces.'...