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

using namespace std;

int main()
{
    int N, M, K;
    cin >> N >> M >> K;
    vector<vector<int>> adj(N+1);
    vector<int> degree(N+1);
    vector<bool> inSubset(N+1, true);

    for(int i = 0; i < M; ++i){
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
        degree[a]++;
        degree[b]++;
    }

    queue<int> q;
    for(int i = 1; i <= N; ++i){
        if(degree[i] < K){
            inSubset[i] = false;
            q.push(i);
        }
    }
    int nrRemaining = N;
    while(!q.empty()){
        int currNode = q.front();
        nrRemaining--;
        q.pop();
        for(int newNode : adj[currNode]){
            if(inSubset[newNode]){
                degree[newNode]--;
                if(degree[newNode] < K){
                    inSubset[newNode] = false;
                    q.push(newNode);
                }
            }
        }
    }
    cout << nrRemaining << endl;
    for(int i = 1; i <= N; ++i){
        if(inSubset[i]){
            cout << i << " ";
        }
    }
    return 0;
}