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
#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<utility>
using namespace std;

#define FOR(I,A,B) for(int I=(A);I<=(B);I++)
#define REP(I,N) for(int I=0;I<(N);I++)
#define ALL(X) (X).begin(),(X).end()
#define PB push_back
#define MP make_pair
#define f first
#define s second

typedef vector<int> VI;
typedef pair<int,int> PII;
typedef long long ll;
typedef vector<string> VS;

const int MAX = 200005;

int st[MAX];
VI g[MAX], q, result;
bool visited[MAX];

void dfs(int x, VI &component) {
	component.PB(x);
	visited[x] = true;

	REP(i,g[x].size())
		if(!visited[g[x][i]]) {
			dfs(g[x][i], component);
		}
}

int main(){
	ios_base::sync_with_stdio(0);

	int n,m,d;

	cin >> n >> m >> d;

	REP(i,m) {
		int a,b;
		cin >> a >> b;
		g[a].PB(b);
		g[b].PB(a);
		++st[a];
		++st[b];
	}

	FOR(i,1,n) 
		if(st[i] < d) {
			visited[i] = true;
			q.PB(i);
		}

	REP(i, q.size()) {
		REP(j, g[q[i]].size()) {
			--st[g[q[i]][j]];
			if(st[g[q[i]][j]] == d - 1) {
				q.PB(g[q[i]][j]);
				visited[g[q[i]][j]] = true;
			}
		}
	}

	FOR(i,1,n)
		if(!visited[i]) {
			VI component;
			dfs(i, component);
			if(component.size() > result.size()) {
				result = component;
			}
		}

	if(result.size() == 0) {
		cout << "NIE\n";
	} else {
		cout << result.size() << '\n';
		REP(i,result.size()) cout << result[i] << ' ';
		cout << '\n';
	}

	return 0;
}