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

#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const int maxn = 1e5;

int n, m, k;
vector<int> g[maxn + 1];
int degree[maxn + 1];
bool removed[maxn + 1];
queue<int> q;

void rem(int x) {
    for(int y : g[x]) {
        degree[y]--;
        if(degree[y] < k && !removed[y]) {
            removed[y] = true;
            q.push(y);
        }
    }
}

void solve() {
    cin >> n >> m >> k;
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
        degree[a]++;
        degree[b]++;
    }
    for(int i = 1; i <= n; i++) {
        if(degree[i] < k) {
            removed[i] = true;
            q.push(i);
        }
    }
    while(!q.empty()) {
        int cur = q.front();
        q.pop();
        rem(cur);
    }
    int cnt = 0;
    for(int i = 1; i <= n; i++) {
        if(!removed[i]) {
            cnt++;
        }
    }
    cout << cnt << "\n";
    for(int i = 1; i <= n; i++) {
        if(!removed[i]) {
            cout << i << " ";
        }
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}