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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
#include <bits/stdc++.h>
using namespace std;
#define INF 1010000000
#define EPS 1E-12
#define MP make_pair
#define ST first
#define ND second
#define SZ(x)((int)(x).size())
#define PB push_back
#define ALL(x) x.begin(), x.end()
#define REP(i,n) for(int i=0; i<(n); ++i)
#define REPD(i,n) for(int i=(n)-1; i>=0; --i)
#define FOR(i,a,n) for(int i=(a); i<=(n); ++i)
#define FORD(i,a,n) for(int i=(a); i>=(n); --i)
#define FORE(i,a) for(__typeof((a).begin()) i=(a).begin();i!=(a).end();++i)
#define D(x) cerr<<#x<<" = "<<x<<", ";
#define DE(x) cerr<<#x<<" = "<<x<<endl;
#define DE2(x,y) cerr<<x<<": "<<y<<endl;
#define D2(t,a,b,n,m) {FOR(_i_, a, n){FOR(_j_, b, m)cerr<</*setw(3)*/" "<<t[_i_][_j_];cerr<<endl;}}
#define B1(w) "("<<w<<")"
#define B2(w,x) "("<<w<<","<<x<<")"
#define B3(w,x,y) "("<<w<<","<<x<<","<<y<<")"
#define B4(w,x,y,z) "("<<w<<","<<x<<","<<y<<","<<z<<")"
typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int UI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
inline bool eq(double a, double b)
	{return abs(a-b)<EPS;}
template<class c1, class c2>
ostream &operator <<(ostream &out, pair<c1, c2> p)
	{return out<<"("<<p.ST<<","<<p.ND<<")";}
template<class c1>
void DB(c1 _ts_, c1 _te_)
	{while(_ts_!=_te_)cerr<</*setw(3)*/" "<<*_ts_, _ts_++;cerr<<endl;}
template<class c1>
void DB(queue<c1> _q_)
	{while(!_q_.empty())cerr<</*setw(3)*/" "<<_q_.front(), _q_.pop();cerr<<endl;}
template<class c1>
void DB(stack<c1> _s_)
	{while(!_s_.empty())cerr<</*setw(3)*/" "<<_s_.top(), _s_.pop();cerr<<endl;}

int n, m, d;
int ers;
vector<int> v[200001];
bool er[200001];
bool vis[200001];
int ins[200001];
bool odp[200001];

int dfs(int a)
{
	vis[a] = 1;
	
	int res = 1;
	
	REP(i, SZ(v[a]))
	{
		int x = v[a][i];
		
		if(er[x] || vis[x])
			continue;
		
		res += dfs(x);
	}
	
	return res;
}

int dfs2(int a)
{
	odp[a] = true;
	
	vis[a] = 1;
	
	int res = 1;
	
	REP(i, SZ(v[a]))
	{
		int x = v[a][i];
		
		if(er[x] || vis[x])
			continue;
		
		res += dfs2(x);
	}
	
	return res;
}

int main()
{
	scanf("%d%d%d", &n, &m, &d);
	
	REP(i, m)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		
		v[a].PB(b);
		v[b].PB(a);
		
		ins[a]++;
		ins[b]++;
	}
	
	queue<int> bac[n + 1];
	
	FOR(i, 1, n)
		bac[ins[i]].push(i);
		
	int mn = 0;
	
	while(mn < d)
	{
		int ak = mn;
		
		while(!bac[ak].empty())
		{
			if(mn < ak)
				break;
			
			int tm = bac[ak].front();
			bac[ak].pop();
			
			if(er[tm])
				continue;
			
			er[tm] = 1;
			ers++;
			
			REP(i, SZ(v[tm]))
			{
				int x = v[tm][i];
				
				if(!er[x])
				{
					ins[x]--;
					bac[ins[x]].push(x);
					mn = min(mn, ins[x]);
				}
			}
		}
		
		if(mn == ak && bac[ak].empty())
			mn++;
	}
	
	////
	// FOR(i, 1, n)
	// {
	// 	DE2(i, er[i])
	// }
	////
	
	if(ers == n)
	{
		printf("NIE\n");
		return 0;
	}
	
	PII mx;
	
	FOR(i, 1, n)
		if(!er[i] && !vis[i])
			mx = max(mx, MP(dfs(i), i));
	
	fill(vis + 1, vis + n + 1, 0);
		
		
	printf("%d\n", mx.ST);
	
	dfs2(mx.ND);
	
	FOR(i, 1, n)
		if(odp[i])
			printf("%d ", i);
	
	return 0;
}
/*
4 4 2
1 2
2 3
3 4
4 2

*/