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
//Krzysztof Pieprzak
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define Size(x) (int)x.size()
#define VAR(v,n) auto v = (n)
#define FOR(i,a,b) for(VAR(i,a); i < (b); ++i)
#define FORE(i,a,b) for(VAR(i,a); i <= (b); ++i)
#define FORREV(i,a,b) for(VAR(i,b); i >= (a); --i)
#define FORSTEP(i,a,b,step) for(VAR(i,a); i < (b); i += (step))
#define FOREACH(i,c) for(VAR(i,(c).begin()); i != (c).end(); ++i)
#define FOREACHS(i,c,n) for(VAR(i,&(c)[0]); i-(c)<(n); ++i)
#define ALL(x) x.begin(),x.end()
#define CLEAR(t) memset(t, 0, sizeof(t))
#define F first
#define S second
#define MP make_pair
#define PUB push_back
#define POB pop_back
#define pieprzu ios_base::sync_with_stdio(0);

const int    INF = 1000000001;
const double EPS = 10e-9;

const int MAXN = 200000;

vpii t[MAXN+5];
queue<int> q;
int vis[MAXN+5];
vi resVs;

void del(int v, int w, int posVInW) {
    t[t[w].back().F][t[w].back().S].S = posVInW;
    swap(t[w][posVInW], t[w].back());
    t[w].POB();
    t[v].POB();
}

void deleteBadVertices(int n, int d) {
    FORE (i, 1, n)
        if (Size(t[i]) < d)
            q.push(i);

    int v;
    pii w;
    while (!q.empty()) {
        v = q.front();q.pop();
        while (!t[v].empty()) {
            w = t[v].back();
            del(v, w.F, w.S);
            if (Size(t[w.F]) < d)
                q.push(w.F);
        }
    }
}

int dfs(int v,  int run) {
    int res = 1;
    vis[v] = run;
    if (run == 1) resVs.PUB(v);
    FOREACH (w, t[v]) {
        if (vis[w->F] != run)
            res += dfs(w->F, run);
    }
    return res;
}

int countSolution(int n) {
    int mx = 0;
    int mxV = 0;
    int res = 0;
    FORE (v, 1, n) {
        if (Size(t[v]) && !vis[v]) {
            res = dfs(v, 1);
            if (res > mx) {
                mx = res;
                mxV = v;
            }
        }
    }

    if (mx) {
        dfs(mxV, 2);
        sort(ALL(resVs));
    }

    return mx;
}

void rob(int test) {
    int n, m, d;
    scanf("%d %d %d", &n, &m, &d);

    int a, b;
    FOR (i, 0, m) {
        scanf("%d %d", &a, &b);
        t[a].PUB(MP(b,Size(t[b])));
        t[b].PUB(MP(a,Size(t[a])-1));
    }

    deleteBadVertices(n, d);
    int res = countSolution(n);

    if (!res)
        printf("NIE\n");
    else {
        printf("%d\n", res);
        FOREACH (v, resVs) printf("%d ", *v);
        printf("\n");
    }
}

int main() {
    int test = 1;
    //scanf("%d", &test);

    FORE (i, 1, test) rob(i);

    return 0;
}