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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <complex>
#include <iterator>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <deque>


using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define MP make_pair
#define PF push_front

const int maxn=((1e5)+5)*2;
VI g[maxn];
VI mak,now;
int maksiz;
bitset <maxn> v,del;
int a,b;
int n,m,d;
int deg[maxn];
//int dupa[maxn];
void dfs(int x)
{
	v[x]=true;
	now.PB(x);
	REP(i,SIZE(g[x]))
	{
		if(!v[g[x][i]] && !del[g[x][i]])
		{
			dfs(g[x][i]);
		}
	}
}
void usun(int x)
{
	if(deg[x]<d && !del[x])
	{
		del[x]=true;
		deg[x]=0;
		REP(i,SIZE(g[x]))
		{
			if(!del[g[x][i]])
			{
				deg[g[x][i]]--;
				if(deg[g[x][i]]<d)
				usun(g[x][i]);
			}
		}
	}
	//
}
int main()
{
	scanf("%d %d %d", &n,&m,&d);
	REP(i,m)
	{
		scanf("%d %d", &a,&b);
		g[a].PB(b);
		g[b].PB(a);
		deg[a]++;
		deg[b]++;
	}
	FOR(i,1,n)
	{
		//if(deg[i]<d && !del[i])
		
		usun(i);
		
	}
	maksiz=0;
	FOR(i,1,n)
	{
		now.clear();
		if(!v[i] && !del[i])
		{
			dfs(i);
		}
		if(SIZE(now)>maksiz)
		{
			maksiz=SIZE(now);
			swap(now,mak);
		}
	}
	if(maksiz<=0)
	{
		printf("NIE\n");
		return 0;
	}
	
	printf("%d\n", maksiz);
	sort(ALL(mak));
	REP(i,maksiz)
	printf("%d ", mak[i]);
	return 0;
}