The connected undirected graph without loops and multiple edges is given. You are allowed to remove the edges from it. Obtain a tree from the graph.
The first line contains the number of vertices and the number of edges of the graph. The next pairs of numbers define the edges. It is guaranteed that the graph is connected.
Print pairs of numbers — the edges that will be included in a tree. The edges can be displayed in any order.