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
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

typedef pair<int, int> pii;

const int MAXN = 200001;

vector<int> graf[MAXN];
bool wast[MAXN];
int stop[MAXN];

int num[MAXN];
bool vis[MAXN];

int n, m, d;

pii siz = pii(0, 0);
int cnt = 0;

void mark(int v)
{
    queue<int> Q;
    Q.push(v);
    wast[v] = true;
    
    while(!Q.empty() )
    {
        v = Q.front();
        Q.pop();
        
        for(int i=0; i<graf[v].size(); i++)
        {
            int u = graf[v][i];
            stop[u]--;
                
            if(stop[u] < d && !wast[u])
            {
                wast[u] = true;
                Q.push(u);
            }
        }
    }
}

void dfs(int v, int instancja)
{
    vis[v] = true;
    num[v] = instancja;
    cnt++;
    
    for(int i=0; i<graf[v].size(); i++)
    {
        int u = graf[v][i];
        
        if(vis[u] || wast[u])
            continue;
        
        dfs(u, instancja);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    
    cin>>n>>m>>d;
    
    for(int i=0; i<m; i++)
    {
        int a, b;
        cin>>a>>b;
        
        graf[a].push_back(b);
        graf[b].push_back(a);
    }
    
    for(int i=1; i<=n; i++)
    {
        stop[i] = graf[i].size();
    }
    
    for(int i=1; i<=n; i++)
    {
        if(stop[i] < d)
            mark(i);
    }
    
    int inst = 1;
    
    for(int i=1; i<=n; i++)
    {
        if(!wast[i] && !vis[i])
        {
            dfs(i, inst);
            siz = max(siz, pii(cnt, inst) );
            
            inst++;
            cnt = 0;
        }
    }
    
    vector<int> res;
    
    for(int i=1; i<=n; i++)
    {
        if(num[i] == siz.second)
            res.push_back(i);
    }
    
    if(siz.first == 0)
    {
        cout<<"NIE\n";
        return 0;
    }
    
    cout<<siz.first<<"\n";
    
    for(int i=0; i<res.size(); i++)
    {
        cout<<res[i]<<" ";
    }
    
    cout<<"\n";
    
    return 0;
}