P1030 - Adjacency List

Memory Limit：1024 MB Time Limit：2.000 S

Judge Style：Text Compare Creator：

Submit：30 Solved：10

Submit Submit Record Statistics ShowOff!

There are $lns="http://www.w3.org/1998/Math/MathML"> �$ cities numbered $lns="http://www.w3.org/1998/Math/MathML"> 1, \dots, �$ , and $lns="http://www.w3.org/1998/Math/MathML"> �$ roads connecting cities.
The $lns="http://www.w3.org/1998/Math/MathML"> �$ -th road $lns="http://www.w3.org/1998/Math/MathML"> (1 \leq � \leq �)$ connects city $lns="http://www.w3.org/1998/Math/MathML"> �_{�}$ and city $lns="http://www.w3.org/1998/Math/MathML"> �_{�}$ .

Print $lns="http://www.w3.org/1998/Math/MathML"> �$ lines as follows.

Let $lns="http://www.w3.org/1998/Math/MathML"> �_{�}$ be the number of cities directly connected to city $lns="http://www.w3.org/1998/Math/MathML"> � (1 \leq � \leq �)$ , and those cities be city $lns="http://www.w3.org/1998/Math/MathML"> �_{�, 1}$ , $lns="http://www.w3.org/1998/Math/MathML"> \dots$ , city $lns="http://www.w3.org/1998/Math/MathML"> �_{�, �_{�}}$ , in ascending order.
The $lns="http://www.w3.org/1998/Math/MathML"> �$ -th line $lns="http://www.w3.org/1998/Math/MathML"> (1 \leq � \leq �)$ should contain $lns="http://www.w3.org/1998/Math/MathML"> �_{�} + 1$ integers $lns="http://www.w3.org/1998/Math/MathML"> �_{�}, �_{�, 1}, \dots, �_{�, �_{�}}$ in this order, separated by spaces.

The input is given from Standard Input in the following format:

 $N$   $lns="http://www.w3.org/1998/Math/MathML"> �$

 $A_{1}$   $lns="http://www.w3.org/1998/Math/MathML"> �_{1}$

 $⋮$

 $A_{M}$   $lns="http://www.w3.org/1998/Math/MathML"> �_{�}$

$2 \leq N \leq 1 0^{5}$
$lns="http://www.w3.org/1998/Math/MathML"> 1 \leq � \leq 1 0^{5}$
$lns="http://www.w3.org/1998/Math/MathML"> 1 \leq �_{�} < �_{�} \leq � (1 \leq � \leq �)$
$lns="http://www.w3.org/1998/Math/MathML"> (�_{�}, �_{�}) \neq (�_{�}, �_{�})$ if $lns="http://www.w3.org/1998/Math/MathML"> (� \neq �)$ .
All values in the input are integers.

 $lns="http://www.w3.org/1998/Math/MathML"> �$

Print $lns="http://www.w3.org/1998/Math/MathML"> �$ lines as specified in the Problem Statement.

The cities directly connected to city $lns="http://www.w3.org/1998/Math/MathML"> 1$ are city $lns="http://www.w3.org/1998/Math/MathML"> 2$ , city $lns="http://www.w3.org/1998/Math/MathML"> 3$ , and city $lns="http://www.w3.org/1998/Math/MathML"> 6$ . Thus, we have $lns="http://www.w3.org/1998/Math/MathML"> �_{1} = 3, �_{1, 1} = 2, �_{1, 2} = 3, �_{1, 3} = 6$ , so you should print $lns="http://www.w3.org/1998/Math/MathML"> 3, 2, 3, 6$ in the first line in this order, separated by spaces.

Note that $lns="http://www.w3.org/1998/Math/MathML"> �_{�, 1}, \dots, �_{�, �_{�}}$ must be in ascending order. For instance, it is unacceptable to print $lns="http://www.w3.org/1998/Math/MathML"> 3, 3, 2, 6$ in the first line in this order.

Atcoder

Submit Submit Record Statistics ShowOff!

1030: Adjacency List

Description

Input

Output

Sample Input Copy

Sample Output Copy

HINT

Source/Category