#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <limits.h>
#include <map>
#include <stack>
#include <algorithm>

using namespace std;

void deledges(vector<vector<int>>& g, vector<int>& degree, int node, int k)
{
	degree[node] = -1;
	for (int i = 0; i < g[node].size(); i++)
	{
		if (--degree[g[node][i]] < k && degree[g[node][i]] > 0)
		{
			deledges(g, degree, g[node][i], k);
		}
	}
}

int main()
{
	int n, m, k, i, node1, node2;
	cin >> n >> m >> k;

	vector<vector<int>> g(n);
	vector<int> degree(n, 0);

	for (i = 0; i < m; i++)
	{
		cin >> node1 >> node2;
		node1--, node2--;

		g[node1].push_back(node2);
		g[node2].push_back(node1);

		degree[node1]++;
		degree[node2]++;
	}

	bool done = false;
	node1 = 0;

	for (i = 0; i < n; i++)
	{
		if (degree[i] < k && degree[i] > 0)
		{
			deledges(g, degree, i, k);
		}
	}

	vector<int> out;
	out.reserve(n);

	for (i = 0; i < n; i++)
	{
		if (degree[i] >= k)
		{
			out.push_back(i);
		}
	}

	cout << out.size() << '\n';

	for (i = 0; i < out.size(); i++)
	{
		cout << out[i] + 1 << ' ';
	}
}