#include <bits/stdc++.h>
using namespace std;

int n, m, k;

vector<int> mennyi;
vector<bool> benne;
vector<vector<int>> graph;

void check(int current) {
  if (!benne[current]) return;
  
  if (mennyi[current] >= k) {
    // jok vagyunk
    return;
  }
  
  benne[current] = false;
  mennyi[current] = 0;
  
  for (int szomszed : graph[current]) {
    mennyi[szomszed]--;
    check(szomszed);
  }
}

int main() {
  cin >> n >> m >> k;
  
  benne.assign(n, true);
  mennyi.assign(n, 0);
  graph.resize(n);
  
  for (int i = 0; m > i; i++) {
    int a, b;
    cin >> a >> b;
    
    a--;
    b--;
    
    graph[a].push_back(b);
    graph[b].push_back(a);
    
    mennyi[a]++;
    mennyi[b]++;    
  }
  
  for (int i = 0; n > i; i++) {
    check(i);
  }
  
  int counter = 0;
  
  for (int i = 0; n > i; i++) {
    if (benne[i]) {
      counter++;
    }
  }
  
  cout << counter << endl;
  
  for (int i = 0; n > i; i++) {
    if (benne[i]) {
      cout << i+1 << " ";
    }
  }
  
  cout << endl;
  
	return 0;
}