Problem: 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 degree of the first vertex (vertex with label 1 on it) is equal to D (or say that there are no such spanning trees). Recall that the degree of a vertex is the number of edges incident to it.

Input

The first line contains three integers n, m and D (2 ≤ n ≤ 2 ⋅ 10^5, n - 1 ≤ m ≤ min(2 ⋅ 10^5, (n(n-1))/(2)), 1 ≤ D < n) — the number of vertices, the number of edges and required degree of the first vertex, 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 ≠ v_i), which are the indices of vertices connected by the edge. There are no loops or multiple edges in the given graph, i. e. 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 ≠ u_i is satisfied.

Output

If there is no spanning tree satisfying the condition from the problem statement, print "NO" in the first line.

Otherwise print "YES" in the first line and then print n-1 lines describing the edges of a spanning tree such that the degree of the first vertex (vertex with label 1 on it) is equal to D. 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.

Examples

Input


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


Output


YES
2 1
2 3
3 4


Input


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


Output


YES
1 2
1 3
4 1


Input


4 4 3
1 2
1 4
2 3
3 4


Output


NO

Note

The picture corresponding to the first and second examples: <image>

The picture corresponding to the third example: <image>

Solution (in PYTHON):

Solution:
from sys import stdin
from collections import *


class disjointset:
    def __init__(self, n):
        self.rank, self.parent, self.n = [0] * (n + 1), [i for i in range(n + 1)], n

    def find(self, x):
        xcopy = x
        while x != self.parent[x]:
            x = self.parent[x]

        while xcopy != x:
            self.parent[xcopy], xcopy = x, self.parent[xcopy]

        return x

    def union(self, x, y):
        xpar, ypar = self.find(x), self.find(y)

        # already union
        if xpar == ypar:
            return -1
        # perform union by rank
        par, child = xpar, ypar
        if self.rank[xpar] < self.rank[ypar]:
            par, child = ypar, xpar

        elif self.rank[xpar] == self.rank[ypar]:
            self.rank[xpar] += 1

        self.parent[child] = par
        self.n -= 1
        out.append([x, y])

    # find min total weight tree
    def kruskal(self):
        result = ['YES']

        # loop over v-1
        for i in range(len(out) - 1, -1, -1):
            u, v = out[i]
            upar, vpar = self.find(u), self.find(v)

            # no cycle
            if upar != vpar:
                result.append('%d %d' % (u, v))
                self.union(upar, vpar)

        # print MST
        print('\n'.join(result))


rints = lambda: [int(x) for x in stdin.readline().split()]
n, m, d = rints()
dis, edges, out = disjointset(n), [], []

for _ in range(m):
    u, v = rints()
    if u == 1 or v == 1:
        edges.append([u, v])
    else:
        dis.union(u, v)

if d < dis.n - 1 or len(edges) < d:
    print('NO')
else:
    ext = []
    for u, v in edges:
        if dis.union(u, v) == -1:
            ext.append([u, v])
        else:
            d -= 1

    out += ext[:d]
    dis1 = disjointset(n)
    dis1.kruskal()