#include <iostream>

using namespace std;

struct{
    int p1; int p2;
} a[200001];
int n, m, k, sz[100001], vsor[100001], utolso;

int main()
{
    cin >> n >> m >> k;

    for(int i = 1; i <= m; i++) {
        cin >> a[i].p1 >> a[i].p2;
        sz[a[i].p1]++;
        sz[a[i].p2]++;
    }

    for(int i = 1; i <= n; i++) {
        if(sz[i] < k) {
            sz[i] = -1;
            utolso++;
            vsor[utolso] = i;
        }
    }

    int elso = 1;
    while(elso <= utolso) {
        int t = vsor[elso];
        for(int i = 1; i <= m; i++) {
            if(a[i].p1 == t && sz[a[i].p2] != -1) {
                sz[a[i].p2]--;
                if(sz[a[i].p2] < k) {
                    sz[a[i].p2] = -1;
                    utolso++;
                    vsor[utolso] = a[i].p2;
                }
            }
            if(a[i].p2 == t && sz[a[i].p1] != -1) {
                sz[a[i].p1]--;
                if(sz[a[i].p1] < k) {
                    sz[a[i].p1] = -1;
                    utolso++;
                    vsor[utolso] = a[i].p1;
                }
            }
        }
        elso++;
    }

    cout << n - utolso << endl;
    for(int i = 1; i <= n; i++)
        if(sz[i] != -1)
            cout << i << ' ';


    return 0;
}