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
// Author: Kamil Nizinski
#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
#include <math.h>
#define debug(fmt,...) fprintf(stderr,fmt, ## __VA_ARGS__)
#define mp make_pair
#define ft first
#define sd second
#define psb push_back
#define ppb pop_back
using namespace std;
typedef long long int ll;
typedef long long unsigned llu;
typedef double dd;
const int MAXN=200003;
int n,m,d,deg[MAXN],sets=0;
vector < int > G[MAXN];
queue < int > Q;
bool del[MAXN],vis[MAXN],inAns[MAXN];
vector < int > S[MAXN];
void DFS(int u) {
  vis[u]=1;
  S[sets].psb(u);
  int i,v;
  for(i=0;i<(int)G[u].size();i++) {
    v=G[u][i];
    if(vis[v] || del[v]) continue;
    DFS(v);
  }
}
int main()
{
  scanf("%d%d%d",&n,&m,&d);
  int i,u,v;
  while(m--) {
    scanf("%d%d",&u,&v);
    G[u].psb(v);
    G[v].psb(u);
    deg[u]++;
    deg[v]++;
  }
  for(u=1;u<=n;u++) if(deg[u]<d) Q.push(u);
  while(!Q.empty()) {
    u=Q.front();
    Q.pop();
    del[u]=1;
    for(i=0;i<(int)G[u].size();i++) {
      v=G[u][i];
      if(del[v]) continue;
      deg[v]--;
      if(deg[v]<d) Q.push(v);
    }
  }
  int best=0;
  for(u=1;u<=n;u++) if(!vis[u] && !del[u]) {
    DFS(u);
    if(((int)S[sets].size())>((int)S[best].size())) best=sets;
    sets++;
  }
  if(((int)S[best].size())==0) printf("NIE\n");
  else {
    printf("%d\n",(int)S[best].size());
    for(i=0;i<(int)S[best].size();i++) inAns[S[best][i]]=1;
    for(u=1;u<=n;u++) if(inAns[u]) printf("%d ",u);
  }
  printf("\n");
  return 0;
}