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
#include <cstdio>
#include <vector>
#include <queue>
#define PB push_back
#define PU push
#define PO pop
#define FI front

using namespace std;
#define N_MAX 200001

int visited[N_MAX];
vector<int> neighbours[N_MAX];
int degree[N_MAX];
int n, m, d;
int a, b;
queue<int> toremove;
int removed[N_MAX];

int DFS(int v, int start) {
  if(visited[v]) {
    return 0;
  }
  visited[v] = start;
  int count = 0;
  for(int i = 0; i < neighbours[v].size(); ++i) {
    if(degree[neighbours[v][i]] >= d) {
      count += DFS(neighbours[v][i], start);
    }
  }

  return count + 1;
}

int main() {
  scanf("%d%d%d", &n, &m, &d);
  for(int i = 0; i < N_MAX; ++i) {
    degree[i] = 0;
    visited[i] = 0;
    removed[i] = 0;
  }

  while (m--) {
    scanf("%d%d", &a, &b);
    degree[a]++;
    degree[b]++;
    neighbours[a].PB(b);
    neighbours[b].PB(a);
  }

  for(int i = 1; i <= n; ++i) {
    if(degree[i] < d) {
      toremove.PU(i);
      removed[i] = 1;
    }
  }

  while(!toremove.empty()) {
    int v = toremove.FI();
    toremove.PO();
    removed[v] = 1;

    for(int i = 0; i < neighbours[v].size(); ++i) {
      degree[neighbours[v][i]]--;
      if(degree[neighbours[v][i]] < d && removed[neighbours[v][i]] == 0) {
        toremove.PU(neighbours[v][i]);
        removed[neighbours[v][i]] = 1;
      }
    }
  }

  int max_connected = 0;
  int first = 0;

  for(int i = 1; i <= n; ++i) {
    if(visited[i] == 0 && degree[i] >= d) {
      int current_connected = DFS(i, i);
      if (current_connected > max_connected) {
        max_connected = current_connected;
        first = i;
      }
    }
  }

  if(first == 0) {
    printf("NIE\n");
  } else {
    printf ("%d\n", max_connected);
    for(int i = 1; i <= n; ++i) {
      if(visited[i] == first) {
        printf("%d ", i);
      }
    }
    printf("\n");
  }

  return 0;
}