#include <iostream>
#include <vector>
#include <queue>

using namespace std;

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

    int N, M, K;
    cin >> N >> M >> K;
    vector<vector<int>> neighbourS(N);
    vector<int> degreeS(N);
    while (M--) {
        int U, V;
        cin >> U >> V;
        ++degreeS[--U];
        ++degreeS[--V];
        neighbourS[U].push_back(V);
        neighbourS[V].push_back(U);
    }
    vector<bool> deletedS(N);
    queue<int> deletionS;
    for (int i = 0; i < N; i++) {
        if (degreeS[i] < K) {
            deletedS[i] = true;
            deletionS.push(i);
        }
    }
    while (!deletionS.empty()) {
        int n = deletionS.front();
        deletionS.pop();
        for (auto e : neighbourS[n]) {
            if (!deletedS[e] && --degreeS[e] < K) {
                deletedS[e] = true;
                deletionS.push(e);
            }
        }
    }
    vector<int> answerS;
    for (int i = 0; i < N; i++) {
        if (!deletedS[i]) {
            answerS.push_back(i);
        }
    }
    cout << answerS.size() << '\n';
    for (auto e : answerS) {
        cout << e + 1 << " ";
    }
    cout << '\n';
}