#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef set<ll> sll;
typedef queue<ll> qll;
typedef priority_queue<ll> pqll;
typedef vector<vll> v2ll;
typedef map<ll,ll> mll;
typedef vector<pll> vpll;
typedef map<pll,ll> mpll;
#define fs first
#define sc second
#define pb push_back

const ll MOD = 1e9+7;



void solve()
{
    ll n, m, k;
    cin >> n >> m >> k;
    v2ll g(n);
    vll rc(n, 0);
    for(ll i = 0; i < m; i++)
    {
        ll a, b;
        cin >> a >> b;
        a--; b--;
        g[a].pb(b);
        g[b].pb(a);
    }

    qll q;
    vll used(n, 0);
    for(ll i = 0; i < n; i++)
    {
        rc[i] = g[i].size();
        if(g[i].size() < k)
        {
            q.push(i);
            used[i] = 1;
        }
    }

    while(!q.empty())
    {
        ll p = q.front();
        q.pop();
        for(ll i : g[p])
        {
            if(!used[i])
            {
                if(rc[i] >= k)
                    rc[i]--;
                if(rc[i] < k)
                {
                    q.push(i);
                    used[p] = 1;
                }
            }
        }
    }

    sll ans;
    for(ll i = 0; i < n; i++)
        if(rc[i] >= k)
            ans.insert(i);
    
    cout << ans.size() << "\n";
    for(ll i : ans)
        cout << i+1 << " ";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
        solve();
    cout << endl;
    return 0;
}