#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> sz(n+1);
    vector<int> gr(n+1,0);
    int x, y;
    for (int i=0; i<m; i++)
    {
        cin >> x >> y;
        sz[x].push_back(y);
        sz[y].push_back(x);
        gr[x]++;
        gr[y]++;
    }
    vector<bool> lat(n+1,false);
    queue<int> sor;
    int cssz=n;
    for (int i=1; i<=n; i++)
    {
        if (gr[i] < k)
        {
            lat[i] = true;
            cssz--;
            sor.push(i);
        }
    }
    int csp;
    while (!sor.empty())
    {
        x = sor.front();
        sor.pop();
        for (int i=0; i<gr[x]; i++)
        {
            csp=sz[x][i];
            if (!lat[csp] && gr[csp]<= k)
            {
                gr[csp]--;
                lat[csp] = true;
                cssz--;
                sor.push(csp);
            }
        }
    }
    cout << cssz << endl;
    for (int i=1; i<=n; i++)
    {
        if (!lat[i])
        {
            cout << i << " ";
        }
    }
    return 0;
}