#include <bits/stdc++.h>
using namespace std;

vector<vector<int> > adj;
vector<bool> jo;
vector<int> be;
int n, m, k;

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

    adj.assign(n+1, {});
    jo.assign(n+1, 1);
    be.assign(n+1, 0);

    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
        be[x]++, be[y]++;
    }

    //cout << endl;

    queue<int> q;
    for(int i = 1; i <= n; i++) {
        //cout << i << ": " << be[i] << '\n';
        if (be[i] < k) {
            q.push(i);
            jo[i] = 0;
        }
    }

    while(!q.empty()) {
        //cout << q.front() << ' ';
        int v = q.front();
        q.pop();
        if(be[v]==0) continue;
        be[v] = 0;
        jo[v] = 0;


        for(int u : adj[v]) {
            if(be[u]>0) be[u]--;
            if(be[u] < k && be[u]!=0) {
                q.push(u);
            }
        }
    }

    vector<int> ans;

    for(int i = 1; i <= n; i++) {
        if(jo[i]) ans.push_back(i);
    }
    cout << ans.size() << endl;
    for(int x : ans) cout << x << ' ';

}

/*
8 12 3
8 7
7 3
4 3
8 5
6 5
3 1
2 1
7 1
2 7
2 3
4 6
4 7
*/