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
#include <stdio.h>
#include <vector>
#include <stack>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstring>

#define ULL64 unsigned long long int
#define MAXI 200001

using namespace std;
vector<int> G[MAXI];
int level[MAXI];
int towns[MAXI];

int main()
{
	memset(level,0,sizeof(level));

	int n,m,d;
	scanf("%i %i %i",&n,&m,&d);

	int a,b;
	for(int i = 0;i<m;i++)
	{
		scanf("%i %i",&a,&b);
		G[a].push_back(b);
		G[b].push_back(a);

		level[a]++;
		level[b]++;
	}

	queue<int> q;
	for(int i = 1;i<=n;i++)
	{
		if(level[i]<d)
		{
			q.push(i);
		}
	}

	while(!q.empty())
	{
		int v = q.front();
		q.pop();

		for(int i = 0;i<G[v].size();i++)
		{
			int p = G[v][i];

			if(level[p]>=d)
			{
				level[p]--;
				if(level[p]<d)
				{
					q.push(p);
				}
			}
		}

	}

	memset(towns,0,sizeof(towns));

	int sidx = 1;
	int max_sidx = 1;

	int maxsn = 0;

	vector<int> tv;


	for(int i = 1;i<=n;i++)
	{
		if(level[i]>=d)
		{
			
			q.push(i);
			level[i]=0;

			while(!q.empty())
			{
				int v = q.front();
				q.pop();

				tv.push_back(v);

				for(int j = 0;j<G[v].size();j++)
				{
					int p = G[v][j];

					if(level[p]>=d)
					{
						level[p]=0;
						q.push(p);
					}
				}
			}

			if(tv.size()>maxsn)
			{
				maxsn = tv.size();
				max_sidx = sidx;
				for(int t = 0;t<tv.size();t++)
				{
					towns[tv[t]]=sidx;
				}

			}
			sidx++;
			tv.clear();
		}
	}

	if(maxsn>0)
	{
		printf("%i\n",maxsn);

		for(int i = 1;i<=n;i++)
		{
			if(towns[i]==max_sidx)
			{
				printf("%i ",i);
			}
		}

		//printf("\n");
	}
	else
	{
		printf("NIE\n");
	}


	return 0;
}