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

int main() {
	int n, m, k; cin >> n >> m >> k;
    vector<vector<int>>g(n);
    vector<int>deg(n);
    for(int i = 0; i < m; i++)
    {
        int a, b; cin >> a >> b;
        a--, b--;
        g[a].push_back(b);
        g[b].push_back(a);
        deg[a]++, deg[b]++;
    }
    queue<int> q;
    vector<bool>b(n, 1);
    for(int i = 0; i < n; i++)
    {
        if(deg[i] < k)
        {
            b[i] = 0;
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int p = q.front();
        q.pop();
        for(int x : g[p])
        {
            if(!b[x])continue;
            deg[x]--;
            if(deg[x] < k)
            {
                b[x] = 0;
                q.push(x);
            }
        }
    }
    vector<int>ans;
    for(int i = 0; i < n; i++)if(b[i])ans.push_back(i+1);
    cout << ans.size() << "\n";
    for(int i : ans)cout << i << " ";
}