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
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>

const int N = 200010;

std::set<int> graf[N];
bool invalid[N];
bool visited[N];
std::queue<int> queue;

void invalidate(int v) {
	if (invalid[v]) {
		return;
	}
	queue.push(v);
	invalid[v] = true;
}

void removeVertex(int v) {
	for (int w : graf[v]) {
		graf[w].erase(v);
	}
	graf[v].clear();
}

int dfs(int v, std::vector<int> &res) {
	int ret = 1;
	res.push_back(v);
	visited[v] = true;
	for (int w : graf[v]) {
		if (!visited[w]) {
			ret += dfs(w, res);
		}
	}
	return ret;
}

int main() {
	int n,m,d;
	scanf("%d%d%d", &n, &m, &d);

	for (int i = 0; i < m; ++i) {
		int a, b;
		scanf("%d%d", &a, &b);
		graf[a].insert(b);
		graf[b].insert(a);
	}

	for (int i = 1; i <= n; ++i) {
		if ((int)graf[i].size() < d) {
			invalidate(i);
		}
	}

	while (!queue.empty()) {
		int v = queue.front();
		queue.pop();
		for (int w : graf[v]) {
			if ((int)graf[w].size() - 1 < d) {
				invalidate(w);
			}
		}
		removeVertex(v);
	}

	int max = 0;
	std::vector<int> res;
	for (int i = 1; i <= n; ++i) {
		if (!visited[i] && !invalid[i]) {
			std::vector<int> tmp;
			int a = dfs(i, tmp);
			if (a > max) {
				max = a;
				res = std::move(tmp);
			}
		}
	}

	if (max == 0) {
		printf("NIE\n");
	} else {
		printf("%d\n", max);
		std::sort(res.begin(), res.end());
		for (int v : res) {
			printf("%d ", v);
		}
		printf("\n");
	}

	return 0;
}