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

using namespace std;

def find_max_k_secure_subnetwork(int n, int m, int k, vector<pair<int, int>>& edges) {
    vector<set<int>> adj(n + 1);
    for (auto [u, v] : edges) {
        adj[u].insert(v);
        adj[v].insert(u);
    }

    set<int> active_nodes;
    vector<int> degree(n + 1);
    for (int i = 1; i <= n; ++i) {
        degree[i] = adj[i].size();
        active_nodes.insert(i);
    }

    queue<int> queue;
    for (int i = 1; i <= n; ++i) {
        if (degree[i] < k) {
            queue.push(i);
        }
    }

    while (!queue.empty()) {
        int node = queue.front();
        queue.pop();
        if (active_nodes.find(node) == active_nodes.end()) continue;
        active_nodes.erase(node);
        for (int neighbor : adj[node]) {
            if (active_nodes.find(neighbor) != active_nodes.end()) {
                degree[neighbor]--;
                if (degree[neighbor] < k) {
                    queue.push(neighbor);
                }
            }
        }
    }

    vector<int> result(active_nodes.begin(), active_nodes.end());
    sort(result.begin(), result.end());
    cout << result.size() << endl;
    for (int i : result) {
        cout << i << " ";
    }
    cout << endl;
}

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

    int n, m, k;
    cin >> n >> m >> k;
    vector<pair<int, int>> edges(m);
    for (int i = 0; i < m; ++i) {
        cin >> edges[i].first >> edges[i].second;
    }

    find_max_k_secure_subnetwork(n, m, k, edges);
    return 0;
}