#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

using ll = long long;

int n, m, k;
vector<vector<int>> adj;
vector<int> ngh_cnt;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m >> k;

    adj.assign(n+1, vector<int>{});
    ngh_cnt.assign(n+1, 0);

    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
        ngh_cnt[u]++;
        ngh_cnt[v]++;
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

    for(int i = 1; i <= n; i++) {
        pq.push({ngh_cnt[i], i});
    }
    vector<bool> deleted(n+1, 0);
    while (!pq.empty()) {
        auto [val, node] = pq.top();
        pq.pop();
        if(val >= k) break;
        if(deleted[node]) continue;
        deleted[node] = 1;
        ngh_cnt[node] = 0;
        for(int to : adj[node]) {
            if(deleted[to]) continue;
            pq.push({--ngh_cnt[to], to});
        }
    }
    int summ = 0;
    for(int i = 1; i <= n; i++) {
        if(!deleted[i]) summ++;
    }
    
    cout << summ << "\n";
    for(int i = 1; i <= n; i++) {
        if(!deleted[i]) cout << i << " ";
    }
}