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

struct node
{
    vector<int> order_;

    int in = 1;
    int connCount = 0;
};

void halfBFS(vector<node> *graph, int currIdx, vector<int> *queue, int k)
{
    if ((*graph)[currIdx].connCount < k && (*graph)[currIdx].in != 0)
    {
        (*graph)[currIdx].in = 0;

        for (int i = 0; i < (*graph)[currIdx].order_.size(); i++)
        {
            int nextIdx = (*graph)[currIdx].order_[i];

            (*graph)[currIdx].connCount = 0;
            (*graph)[nextIdx].connCount--;
            if ((*graph)[nextIdx].connCount < k && (*graph)[nextIdx].in != 0)
            {
                (*queue).push_back(nextIdx);
            }
        }

        while ((*queue).size() != 0)
        {
            int d = (*queue)[0];
            (*queue).erase((*queue).begin());
            if ((*graph)[d].connCount < k && (*graph)[d].in != 0)
                halfBFS(graph, d, queue, k);
        }
    }
}

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

    vector<node> graph(n + 1);
    graph[0].in = 0;
    for (int i = 0; i < m; i++)
    {
        int u, v;
        cin >> u >> v;

        graph[u].order_.push_back(v);
        graph[v].order_.push_back(u);

        graph[u].connCount++;
        graph[v].connCount++;
    }
    vector<int> q(0);

    for (int i = 1; i < n + 1; i++)
    {
        if (graph[i].connCount < k)
            halfBFS(&graph, i, &q, k);
    }

    int ossz = 0;
    vector<int> end(0);
    for (int i = 1; i < n + 1; i++)
    {
        if (graph[i].in == 1)
        {
            ossz++;
            end.push_back(i);
        }
    }
    cout << ossz << endl;

    for (int i = 0; i < end.size(); i++)
    {
        cout << end[i] << " ";
    }
}