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
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>		//UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>		//do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;

#define MR 200010

vector < int > g[MR];

int ile[MR], ileS[MR];

int done[MR];

int nrS;

void dfs(int nr)
{
	done[nr] = nrS;
	REP(i,(int)g[nr].size())
		if(!done[g[nr][i]] && ile[g[nr][i]] > -1)
			dfs(g[nr][i]);
}

int main()
{
	int n, m, d;
	scanf("%d%d%d", &n, &m, &d);
	REP(i,m)
	{
		int a, b;
		scanf("%d%d", &a, &b);a--;b--;
		g[a].PB(b);
		g[b].PB(a);
	}

	set < pair < int, int > > S;

	REP(i,n)
	{
		ile[i] = g[i].size();
		S.insert(MP(ile[i],i));
	}

	while(!S.empty())
	{
		pair < int, int > p = *S.begin();
		if(p.ST < d)
		{
			S.erase(p);
			ile[p.ND] = -1;
			REP(i,(int)g[p.ND].size())
				if(ile[g[p.ND][i]] > -1)
				{
					pair < int, int > p1(ile[g[p.ND][i]], g[p.ND][i]);
					S.erase(p1);
					ile[g[p.ND][i]]--;
					p1.ST--;
					S.insert(p1);
				}
		}
		else break;
	}

	if(S.empty()) printf("NIE\n");
	else
	{
		// wyznacz maks spojna skladowa
		REP(i,n)
			if(!done[i] && ile[i] > -1)
			{
				nrS++;
				dfs(i);
			}
		REP(i,n) ileS[done[i]]++;
		int maxS = 1;
		FORQ(i,1,nrS)
			if(ileS[i] > ileS[maxS])
				maxS = i;
		
		printf("%d\n", ileS[maxS]);
		REP(i,n)
			if(done[i] == maxS)
				printf("%d ", i+1);
		printf("\n");
	}

	return 0;
}