#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<int> deg;
vector<bool> op;

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    g.resize(n+1);
    deg.assign(n+1, 0);
    op.assign(n+1, true);
    while (m--){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
        deg[a]++;
        deg[b]++;
    }
    queue<int> q;
    for (int i=1; i<=n; i++){
        if (deg[i] < k){
            q.push(i);
        }
    }
    int c = 0;
    while (!q.empty()){
        int v = q.front();
        q.pop();
        if (!op[v]) continue;
        op[v] = false;
        c++;
        for (int x : g[v]){
            deg[x]--;
            if (op[x] && deg[x] < k){
                q.push(x);
            }
        }
    }
    cout << n - c << "\n";
    for (int i=1; i<=n; i++){
        if (op[i]) cout << i << " ";
    }
}