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
131
132
133
134
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int INF=INT_MAX;
const int MAXN=200000+5;

int n, m,d;

int deg[MAXN];
list<int> edges[MAXN];
queue<int> to_del;

int visited[MAXN];

int maxi;
int maxv;

int visit(int i) {
    visited[i]=i;
    queue<int> to_visit;
    to_visit.push(i);
    int count=1;
    while (!to_visit.empty()) {
        int vi=to_visit.front();
        to_visit.pop();
        FORE(edge,edges[vi]) {
            if (deg[*edge]>=d && visited[*edge]==0) {
                visited[*edge]=i;
                to_visit.push(*edge);
                count++;
            }
        }
    }
    return count;
}

int main() {
    //ios_base::sync_with_stdio(0);
    
    SI(n);
    SI(m);
    SI(d);
    int a, b;
    REP(i, m) {
        SI(a); SI(b);
        
        deg[a]++;
        deg[b]++;
        
        edges[a].push_back(b);
        edges[b].push_back(a);
    }
    
    FOR(i,1,n) {
        if (deg[i]<d) {
            to_del.push(i);
        }
    }
    while (!to_del.empty()) {
        int di=to_del.front();
        to_del.pop();
        
        FORE(edge, edges[di]) {
            deg[*edge]--;
            if (deg[*edge]==d-1) {
                to_del.push(*edge);
            }
        }
    }
    
    FOR(i, 1, n) {
        
        if (visited[i]==0 && deg[i]>=d) {
            int vv=visit(i);
            if (vv>maxv) {
                maxv=vv;
                maxi=i;
            }
        }
    }
//    printf("\n");
//    FOR(i, 1, n) {
//        printf("%d ", visited[i]);
//    }
//    printf("\n");

    if (maxv){
        printf("%d\n",maxv);
        FOR(i, 1, n) {
            if (visited[i]==maxi) {
                printf("%d ",i);
            }
        }
    } else {
        printf("NIE\n");
    }
    
    return 0;
}