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

int n,m,k;
vector<vector<int> > g;
vector<int> mo;
vector<bool> volt;
set<int> curr;

bool dfs(int x) {

    int cnt = 0;
    curr.insert(x);
    for(int sz : g[x]) {
        if(!volt[sz] && g[sz].size() >= k) {
            volt[sz] = true;
            if(dfs(sz)) {
                cnt++;
            }
        }
        else if(curr.find(sz) != curr.end()) cnt++;
    }
    if(cnt < k) {
        curr.erase(x);
        return false;
    }
    return true;
}

int main()
{
    cin >> n >> m >> k;
    g.resize(n+1);
    volt.resize(n+1, false);

    for(int i = 0; i < m; i++) {
        int x,y;
        cin >> x >> y;

        g[x].push_back(y);
        g[y].push_back(x);
    }

    for(int i = 1; i <= n; i++) {
        if(g[i].size() >= k && !volt[i]) {
            curr.clear();
            volt[i] = true;
            if(dfs(i) && curr.size() > mo.size()) {
                mo.clear();
                for(int j : curr) mo.push_back(j);
            }
        }
    }
    sort(mo.begin(), mo.end());
    cout << mo.size() << endl;
    for(int i : mo) cout << i << ' ';

    return 0;
}