// Source: https://usaco.guide/general/io

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

int main() {
    int n,m,k;cin>>n>>m>>k;
    vector<vector<int>> v(n);
    vector<int> befok(n),van(n);
    for(int i = 0;i<m;i++){
        int a,b;cin>>a>>b;
        a--;b--;
        befok[a]++;befok[b]++;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    queue<int> q;
    for(int i = 0;i<n;i++){
        if(befok[i]<k){
            q.push(i);
            van[i]=1;
            //cout<<i<<endl;
        }
    }
    while(!q.empty()){
        int i=q.front();
        q.pop();
        for(int u : v[i]){
            befok[u]--;
            if(!van[u]&&befok[u]<k){
                van[u]=1;
                q.push(u);
            }
        }
    }
    int cnt=0;
    vector<int> ans;
    for(int i = 0;i<n;i++){
        if(!van[i]){
            cnt++;
            ans.push_back(i);
        }
    }
    cout<<cnt<<endl;
    for(int i : ans)cout<<i+1<<' ';
    cout<<endl;
}