B"You are given an undirected unweighted connected graph consisting of n vertices and m edges. It is guaranteed that there are no self-loops or multiple edges in the given graph. Your task is to find any spanning tree of this graph such that the maximum degree over all vertices is maximum possible. Recall that the degree of a vertex is the number of edges incident to it. The first line contains two integers n and m ( 2 <= n <= 2 cdot 10^5 , n - 1 <= m <= min(2 cdot 10^5, frac{n(n-1)}{2}) ) -- the number of vertices and edges, respectively. The following m lines denote edges: edge i is represented by a pair of integers v_i , u_i ( 1 <= v_i, u_i <= n , u_i ne v_i ), which are the indices of vertices connected by the edge. There are no loops or multiple edges in the given graph, i. xe2 x80 x89e. for each pair ( v_i, u_i ) there are no other pairs ( v_i, u_i ) or ( u_i, v_i ) in the list of edges, and for each pair (v_i, u_i) the condition v_i ne u_i is satisfied. Print n-1 lines describing the edges of a spanning tree such that the maximum degree over all vertices is maximum possible. Make sure that the edges of the printed spanning tree form some subset of the input edges (order doesn't matter and edge (v, u) is considered the same as the edge (u, v) ). If there are multiple possible answers, print any of them. Picture corresponding to the first example: In this example the number of edges of spanning tree incident to the vertex 3 is 3 . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer. Picture corresponding to the second example: In this example the number of edges of spanning tree incident to the vertex 1 is 3 . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer. Picture corresponding to "...