Description

In graph theory programming, adjacency lists are commonly used as data structures. Since dynamic pointers are slower than static arrays for access, many OI contestants use arrays to simulate pointers. Let's learn this programming method.
There are $N$ vertices, numbered from $1$ to $N$. There are $M$ edges, each represented by the two vertices it connects, such as ($3$, $8$), indicating an edge between vertices $3$ and $8$ (undirected edge). Please output the vertices adjacent to each vertex through edges.

Input Format

The first line contains two integers $N$ and $M$, where $N$ is in the range [$1$...$5000$] and $M$ is in the range [$1$...$100000$]. The next $M$ lines each contain two integers representing an edge.

Output Format

$N$ lines, where the first number $k$ in the $i$-th line indicates how many edges are connected to vertex $i$, followed by $k$ numbers indicating which $k$ vertices are connected to vertex $i$ by an edge.

Sample

5 6
1 3
2 4
1 4
2 3
3 5
2 5

2 4 3
3 5 3 4
3 5 2 1
2 1 2
2 2 3