【DFS+pair+思维】保留1节点的度数为d，求树 F2. Spanning Tree with One Fixed Degree Codeforces Round #544 (Div. 3)

 F2. Spanning Tree with One Fixed Degree  Codeforces Round #544 (Div. 3)

http://codeforces.com/problemset/problem/1133/F2

time limit per test   3 seconds     memory limit per test     256 megabytes

You are given an undirected unweighted connected graph consisting of nn vertices and mm 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 11 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⋅105, n−1≤m≤min(2⋅1e5,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 mm lines denote edges: edge ii is represented by a pair of integers vi, uiui (1≤vi,ui≤n ui≠vi), 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 (vi,ui) there are no other pairs (vi,ui) or (ui,vi) in the list of edges, and for each pair (vi,ui) the condition vi≠uivi≠ui 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

Copy

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

output

Copy

YES
2 1
2 3
3 4

input

Copy

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

output

Copy

YES
1 2
1 3
4 1

input

Copy

4 4 3
1 2
1 4
2 3
3 4

output

Copy

NO

Note

The picture corresponding to the first and second examples:

The picture corresponding to the third example:

#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
typedef pair<int,int> pii;
vector <int> G[maxn],first[maxn];
vector <pii> ans;  //存放答案
queue <int> q;  //与答案有关
int du[maxn],vis[maxn],tot;

void dfs(int x)
{
    vis[x]=1;
    for(auto v:G[x])
    {
        if(vis[v]) continue;
        if(v==1)
        {
            first[tot].push_back(x);  //从2开始找，如果找到与1相连的，就停止，代表这是必须与1相连的边
            continue;
        }
        dfs(v);
    }
}

int main()
{
    int n,m,d,u,v;
    scanf("%d%d%d",&n,&m,&d);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
        G[v].push_back(u);
        du[u]++,du[v]++;
    }

    if(du[1]<d)  //如果本身1的度数<d，那也是NO
    {
        printf("NO\n");
        return 0;
    }

    for(int i=2;i<=n;i++)
    {
        if(!vis[i])
        {
            tot++;
            dfs(i); //就代表如果要建出图的话，至少需要tot个与1相连的
        }
    }

    if(tot>d)  //如果连通块>d,就No
    {
        printf("NO\n");
        return 0;
    }

    memset(vis,0,sizeof vis);  //后面的vis是在记录答案

    vis[1]=1;
    for(int i=1;i<=tot;i++)   //每个连通块先连一条边
    {
        int k=first[i].back();
        first[i].pop_back();
        vis[k]=1;
        ans.push_back(pii(1,k));
        q.push(k);
        d--;
    }

    for(int i=1;i<=tot;i++)   //还有d余量,就随便连
    {
        while(d>0&&first[i].size()>0)
        {
            int k=first[i].back();
            first[i].pop_back();
            vis[k]=1;
            ans.push_back(pii(1,k));
            q.push(k);
            d--;
        }
    }

    while(!q.empty())
    {
        int k=q.front();
        q.pop();
        for(auto x:G[k])
        {
            if(vis[x]) continue;
            vis[x]=1;
            ans.push_back(pii(k,x));
            q.push(x);
        }
    }

    printf("YES\n");
    for(int i=0;i<n-1;i++)
    {
        printf("%d %d\n",ans[i].first,ans[i].second);
    }

    return 0;
}