Very easy

Execution time limit is 3 seconds

Runtime memory usage limit is 128 megabytes

Create an undirected graph that supports the next operations:

AddEdge(u, v) - add to the graph an edge between the vertices (u, v);

Vertex(u) - print the list of vertices, adjacent with the vertex u.

There is no loops and multiple edges in the graph.

The first line contains the number of vertices in a graph n (1 ≤ n ≤ `10^5`

). The next line contains the number of operations k (0 ≤ k ≤ `10^6`

). Each next line describes the operation in format: "1 <number> <number>" or "2 <number>", representing respectively the operation AddEdge(u, v) and Vertex(u).

It is guaranteed that the total amount of numbers to be printed during all operations Vertex, does not exceed 2 * `10^5`

.

For each operation Vertex print in a separate line the list of adjacent vertices for a given vertex. The vertices in a list can be printed in any order. If some vertex hasn't adjacent vertices, print the empty line.

Input #1

Answer #1