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
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

const int maxn = 200200;

int n,m,d;
int vis[maxn], cnt[maxn], p[maxn];
vi g[maxn];

void dfs(int u) {
	vis[u] = 1;
	FOR(i,g[u].size()) {
		int v = g[u][i];
		if (vis[v]) continue;
		p[v]--;
		if (p[v]<d) dfs(v);
	}
}

void dfscol(int u, int col) {
	vis[u] = col;
	cnt[col]++;
	FOR(i,g[u].size()) {
		int v = g[u][i];
		if (vis[v]) continue;
		dfscol(v, col);
	}
}

int main () {
	scanf("%d%d%d", &n, &m, &d);
	FOR(i,m) {
		int a,b;
		scanf("%d%d", &a, &b);
		a--; b--;
		g[a].pb(b);
		g[b].pb(a);
		p[a]++;
		p[b]++;
	}
	FOR(i,n) if (!vis[i] && p[i]<d) dfs(i);
	int col=2;
	FOR(i,n) if (!vis[i]) dfscol(i, col++);
	if (col==2) {
		printf("NIE\n");
		return 0;
	}
	int best=0;
	FOR(i,col) if (cnt[i]>cnt[best]) best=i;
	printf("%d\n", cnt[best]);
	FOR(i,n) if (vis[i]==best) printf("%d ", i+1);
	printf("\n");
	return 0;
}