#include <iostream>
#include <vector>
#include <set>
#include <stack>
#include <queue>

using namespace std;

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

    vector<set<int>> map(n);
    for (i = 0; i < m; i++) {
        cin >> temp1 >> temp2;
        temp1--; temp2--;
        map[temp1].insert(temp2);
        map[temp2].insert(temp1);
    }

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

    while (!bad.empty()) {
        int node = bad.front();
        bad.pop();
        for (int v : map[node]) {
            map[v].erase(node);
            if (map[v].size() < k) {
                bad.push(v);
            }
        }
    }

    vector<int> out;
    for (i = 0; i < n; i++) {
        if (map[i].size() >= k) {
            out.push_back(i);
        }
    }
    cout << out.size() << endl;
    for (i = 0; i < out.size(); i++) {
        cout << out[i]+1 << " ";
    }
}