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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int N = 201010;
vi za[N];
int rozm[N];
bool usun[N];
bool vis[N];
vi res;
int n, m, d;

void gogo(int vert) {
	queue<int> Q;
	int cnt = 0;
	Q.push(vert);
	vis[vert] = true;
	vi temp;
	while (!Q.empty()) {
		int ter = Q.front(); Q.pop();
		temp.PB(ter);
		for (auto p : za[ter]) {
			if (!usun[p] && !vis[p]) {
				vis[p] = true;
				Q.push(p);
			}
		}
	}
	if (SIZE(temp) > SIZE(res)) {
		res = temp;
	}
}

int main() {
	scanf("%d %d %d", &n, &m, &d);
	REP(i, m) {
		wez2(a, b);
		--a; --b;
		za[a].PB(b);
		za[b].PB(a);
		++rozm[a]; ++rozm[b];
	}
	queue<int> Q;
	REP(i, n) {
		if (rozm[i] < d) {
			Q.push(i);
			usun[i] = true;
		}
	}
	while (!Q.empty()) {
		int q = Q.front(); Q.pop();
		for (auto p : za[q]) {
			--rozm[p];
			if (!usun[p] && rozm[p] < d) {
				Q.push(p);
				usun[p] = true;
			}
		}
	}
	REP(i, n) {
		if (!usun[i] && !vis[i]) {
			gogo(i);
		}
	}
	if (SIZE(res) == 0) {
		printf("NIE\n");
	} else {
		printf("%d\n", SIZE(res));
		for (auto p : res) {
			printf("%d ", p + 1);
		}
		printf("\n");
	}
	return 0;
}