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

int main()
{
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<int>> graph(n+1);
    queue<int> q;
    vector<int> edge(n+1,0);
    int x,y;
    for(int i=0;i<m;i++)
        {
        cin>>x>>y;
        graph[x].push_back(y);
        graph[y].push_back(x);
        edge[x]++;
        edge[y]++;
        }
    vector<bool> visited(n+1,false);
    for(int i=1;i<=n;i++)
        {
      //  cout<<edge[i]<<" ";
        if(edge[i]<k)
            {
            q.push(i);
            visited[i]=true;
            }
        }

    while(!q.empty())
        {
        int curr=q.front();q.pop();
        //cout<<curr<<" ";
       
        for(auto x : graph[curr])
            {
            if(!visited[x])
                {
                edge[x]--;
                if(edge[x]<k)
                    {
                     visited[curr]=true;
                    q.push(x);
                    }
                }
            }
        }
    vector<int> ans;
    for(int i=1;i<=n;i++)
        {
        if(!visited[i])
            {
            ans.push_back(i);
            }
        }
    cout<<ans.size()<<"\n";
    for(auto x : ans)
        {
        cout<<x<<" ";
        }
    return 0;
}