#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int> > elek(n);
    vector<int> fok(n, 0);
    for (int i=0; i<m; i++) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        elek[x].push_back(y);
        elek[y].push_back(x);
        fok[x]++;
        fok[y]++;
    }

    queue<int> hibas;
    for (int i=0; i<n; i++) {
        if (fok[i]<k) {
            hibas.push(i);
        }
    }

    while (hibas.size()>0) {
        int x=hibas.front();
        fok[x]=-1;
        hibas.pop();
        for (int sz : elek[x]) {
            fok[sz]--;
            if (fok[sz]==k-1) {
                hibas.push(sz);
            }
        }
    }

    vector<int> veg;
    int ossz=0;
    for (int i=0; i<n; i++) {
        if (fok[i]>=k) {
            veg.push_back(i+1);
            ossz++;
        }
    }

    cout << ossz << "\n";
    for (int sz : veg) {
        cout << sz << " ";
    }

    return 0;
}