1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
const int N=200004;

set<int> graf[N];
vector<int> graf2[N];
bool nbufor[N];

void DFS(int w,int & tmpwynik,vector<int>& tmpvec)
{
    nbufor[w]=1;
    tmpwynik++;
    tmpvec.push_back(w);
    for(int i=0;i<graf2[w].size();i++)
    {
        if(!nbufor[graf2[w][i]])
        DFS(graf2[w][i],tmpwynik,tmpvec);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    int n,m,d;
    cin>>n>>m>>d;
    int a,b;

    for(int i=0;i<m;i++)
    {
        cin>>a>>b;
        graf[a].insert(b);
        graf[b].insert(a);
        graf2[a].push_back(b);
        graf2[b].push_back(a);
    }
    queue<int> Q;
    for(int i=1;i<=n;i++)
    {
        if(graf[i].size()<d)
            {
                nbufor[i]=1;
                Q.push(i);
            }
    }
    int tmp;;
    while(!Q.empty())
    {
        tmp=Q.front();
        Q.pop();
        nbufor[tmp]=1;
        for(int i=0;i<graf2[tmp].size();i++)
        {
            graf[graf2[tmp][i]].erase(tmp);
            if(graf[graf2[tmp][i]].size()<d && !nbufor[graf2[tmp][i]])
                {
                    nbufor[graf2[tmp][i]]=1;
                    Q.push(graf2[tmp][i]);
                }
        }

    }


    int wynik=0;
    vector<int> myvec;
    for(int i=1;i<=n;i++)
    {
        int tmpw=0;
        vector<int> tmpv;
        if(!nbufor[i])
        {
            DFS(i,tmpw,tmpv);
        }
        if(tmpw>wynik)
        {
            wynik=tmpw;
            myvec=tmpv;
        }
    }
    if(wynik==0)
        cout<<"NIE";
    else
    {
        cout<<wynik<<endl;
        sort(myvec.begin(),myvec.end());
        for(int i=0;i<myvec.size();i++)
            cout<<myvec[i]<<" ";

    }
    return 0;
}