#include <iostream>
#include <vector>
#include <deque>
#include <utility>
#include <algorithm>

using namespace std;

struct pont
{
    int lat, lep;
    vector<int> sz;
};

bool comp(pair<int, int> a, pair<int, int> b)
{
    if (a.first > b.first)
        return true;
    return false;
}
vector<pont> v;
deque<int> wl;
vector<pair<int, int>> nei;
vector<int> na;

int main()
{
    int csp, utk, k, a, b;
    cin >> csp >> utk >> k;

    v.resize(csp + 1);
    nei.resize(csp + 1);

    for (int i = 1; i <= utk; ++i)
    {
        cin >> a >> b;
        v[a].sz.push_back(b);
        v[b].sz.push_back(a);
    }

    for (int i = 1; i < v.size(); ++i)
    {
        for (auto& e : v[i].sz)
        {
            nei[e].first++;
            nei[e].second = e;
        }
    }
    cout << k + 1 << endl;
    sort(nei.begin(), nei.end(), comp);
    for (int i = 0; i <= k; ++i)
        na.push_back(nei[i].second);
    sort(na.begin(), na.end());
    for (auto& e : na)
        cout << e << " ";
}