#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<int>> adj(n+1);
    vector<int> indegree(n+1,0);
    for(int i=0; i<m; i++)
    {
        int x,y;
        cin>>x>>y;
        adj[x].push_back(y);
        adj[y].push_back(x);
        indegree[x]++;
        indegree[y]++;
    }
    queue<int> q;
    int res=n;
    vector<bool> seen(n+1,false);
    for(int i=1; i<=n; i++)
    {
        if(indegree[i]<k)
        {
            res--;
            seen[i]=true;
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int v=q.front();
        q.pop();
        for(auto next:adj[v])
        {
            if(!seen[next])
            {
                indegree[next]--;
                if(indegree[next]<k)
                {
                    res--;
                    seen[next]=true;
                    q.push(next);
                }
            }
        }
    }
    cout<<res<<endl;
    for(int i=1; i<=n; i++)
    {
        if(!seen[i])
            cout<<i<<" ";
    }
    return 0;
}