{"raw_statement":[{"iden":"problem statement","content":"There are $N$ cities numbered $1, \\dots, N$, and $M$ roads connecting cities.  \nThe $i$\\-th road $(1 \\leq i \\leq M)$ connects city $A_i$ and city $B_i$.\nPrint $N$ lines as follows.\n\n*   Let $d_i$ be the number of cities directly connected to city $i \\, (1 \\leq i \\leq N)$, and those cities be city $a_{i, 1}$, $\\dots$, city $a_{i, d_i}$, in **ascending order**.\n*   The $i$\\-th line $(1 \\leq i \\leq N)$ should contain $d_i + 1$ integers $d_i, a_{i, 1}, \\dots, a_{i, d_i}$ in this order, separated by spaces."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 10^5$\n*   $1 \\leq M \\leq 10^5$\n*   $1 \\leq A_i \\lt B_i \\leq N \\, (1 \\leq i \\leq M)$\n*   $(A_i, B_i) \\neq (A_j, B_j)$ if $(i \\neq j)$.\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $B_1$\n$\\vdots$\n$A_M$ $B_M$"},{"iden":"sample input 1","content":"6 6\n3 6\n1 3\n5 6\n2 5\n1 2\n1 6"},{"iden":"sample output 1","content":"3 2 3 6\n2 1 5\n2 1 6\n0\n2 2 6\n3 1 3 5\n\nThe cities directly connected to city $1$ are city $2$, city $3$, and city $6$. Thus, we have $d_1 = 3, a_{1, 1} = 2, a_{1, 2} = 3, a_{1, 3} = 6$, so you should print $3, 2, 3, 6$ in the first line in this order, separated by spaces.\nNote that $a_{i, 1}, \\dots, a_{i, d_i}$ must be in ascending order. For instance, it is unacceptable to print $3, 3, 2, 6$ in the first line in this order."},{"iden":"sample input 2","content":"5 10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5"},{"iden":"sample output 2","content":"4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}