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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>


/* PA-2015 R2 */
/* Korzystałem z kodu zaczęrpniętego z książki Piotr Stańczyka "Algorytmika Praktyczna" - struktury danych grafu oraz znajdowanie spójnych składowych */
using namespace std;

typedef vector<int> VI;
typedef long long LL;

#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
#include <list>
template<class V, class E> struct Graph {
	struct Ed : E {
		int v; 
		Ed(E p, int w) : E(p), v(w) {}
    bool operator==(const Ed& rhs) const
    {
        return v == rhs.v;
    }
	};
	struct Ve : V,vector<Ed> {};
	vector<Ve> g;
	Graph(int n=0) : g(n) {}
	void EdgeD(int b, int e, E d = E()) {g[b].PB(Ed(d,e));}
	void Add(int b, int e) {EdgeD(b, e); EdgeD(e, b);}

	void EdgeDRemove(int b, int e) {
//		printf("Removing %d -> %d\n", b, e);
		E d = E();
		g[b].erase(  find(g[b].begin(), g[b].end(), Ed(d,e))  );
	}

	void Rem(int b, int e) {
		EdgeDRemove(b, e);
		EdgeDRemove(e, b);
	}

 int nr;
 void SccSDfs(int v) {
 	if (g[v].t == -1) {
		 g[v].t = nr;
 	FOREACH(it, g[v]) SccSDfs(it->v);
 	if (nr < 0) g[v].t = -(--nr) - 3;
 	}
 }
 void SccS() {
 	Graph<V, E> gt(SIZE(g));
	 REP(x, SIZE(g)) {
		 g[x].t = gt.g[x].t = -1;
		 FOREACH(it, g[x]) gt.EdgeD(it->v, x);
 	}
 	gt.nr = -2;
 	nr = 0;
 	VI v(SIZE(g));
 	REP(x, SIZE(g)) {
	 gt.SccSDfs(x);
	 v[gt.g[x].t] = x;
 	}

 FORD(x, SIZE(g) - 1, 0) {
 SccSDfs(v[x]);
 nr++;
 }
}
};


struct Ve {}; 
struct Vs {
	int t;
};
	
int main() {
	int n, m, d, b, e;
	Ve ed;

	// init
	scanf("%d %d %d", &n, &m, &d);
	Graph<Vs, Ve> g(n);
	REP(x, m) {
		scanf("%d %d", &b, &e);
		g.Add(b - 1, e - 1);
	}

	// remove irrelevant edges
	priority_queue<int> todo;
	
	REP(x, n) {
		if(SIZE(g.g[x]) < d)
		{
			todo.push(x);
		}
	}
				

	while(!todo.empty())
	{
			int x = todo.top();
			todo.pop();
			
			FOREACH(i, g.g[x])
			{	
				g.EdgeDRemove(i->v, x);			
				if(SIZE(g.g[i->v]) < d)
				{
					todo.push(i->v);
				}
			}
			g.g[x].clear();

	}

	// connected components
	g.SccS();

	// find max
	int max = -1;
	int max_ind = -1;
	vector<int> comp [200100];
	REP(x, n)
	{

		if(SIZE(g.g[x]))
		{
						comp[g.g[x].t].PB(x);
						if(SIZE(comp[g.g[x].t]) > max)
						{
							max = SIZE(comp[g.g[x].t]);
							max_ind = g.g[x].t;
						}
		}	
	}


	if(max == -1)
	{
		printf("NIE\n");
	}
	else
	{
		sort(comp[max_ind].begin(), comp[max_ind].end());
		printf("%d\n", max);
		FOREACH(i, comp[max_ind])
		{
			printf("%d ", *i + 1);
		}
		printf("\n");
	}

	return 0;
}