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

struct adat
{
    int db;
    bool lat;
    vector <int> sz;
};
int n,m,k,i,akt,a,b;

int main()
{
    cin>>n>>m>>k;
    vector <adat> x(n+1);

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

    for(i=1; i<=n; ++i)
    {
        x[i].db=x[i].sz.size();
        if(x[i].db<k)
        {
            s.push(i);
            x[i].lat=1;
        }
    }
    while(!s.empty())
    {
        akt=s.front();
        s.pop();
        for(auto &e:x[akt].sz)
        {
            --x[e].db;
            if(x[e].db<k && x[e].lat==0)
            {
                x[e].lat=1;
                s.push(e);
            }
        }
    }

    for(i=1; i<=n; ++i)
    {
        if(x[i].lat==0)
        {
            s.push(i);
        }
    }
    cout<<s.size()<<'\n';

    while(!s.empty())
    {
        cout<<s.front()<<' ';
        s.pop();
    }

    return 0;
}