#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> csucsok;

int main()
{
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> befok(n);
    csucsok.assign(n, vector<int>());
    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        a--; b--;

        befok[a]++;
        befok[b]++;
        csucsok[a].push_back(b);
        csucsok[b].push_back(a);
    }

    vector<vector<int>> uj(n, vector<int>());
    vector<bool> benne(n, 1);
    for(int i = 0; i < n; i++){
        if(befok[i] < k){
            benne[i] = 0;
            continue;
        }

        for(int x : csucsok[i]){
            if(befok[x] < k) continue;

            uj[i].push_back(x);
        }
    }

    queue<int> bejar;

    for(int i = 0; i < n; i++){
        befok[i] = uj[i].size();

        if(befok[i] != 0 && befok[i] < k){
            bejar.push(i);
        }
    }

    while(!bejar.empty()){
        int akt = bejar.front();
        bejar.pop();

        if(!benne[akt]) continue;

        benne[akt] = 0;

        for(int x : uj[akt]){
            if(!benne[x]) continue;

            befok[x]--;

            if(befok[x] < k){
                bejar.push(x);
            }
        }
    }

    vector<int> megoldas;
    for(int i = 0; i < n; i++){
        if(benne[i]){
            megoldas.push_back(i);
        }
    }

    cout << megoldas.size() << "\n";
    for(int x : megoldas){
        cout << x + 1 << " ";
    }
    cout << "\n";
}