#include <bits/stdc++.h>
using namespace std;
vector<int> g[1000001];
int main() {
	int n, m,k;
	cin>>n>>m>>k;
	vector<int> c(n+1);
	for (int i=0; i<m;i++){
		int x,y;
		cin>>x>>y;
		c[x]++;
		c[y]++;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	queue<int> q; 
	int ans=n; 
	bool seen[1000001];
	for (int i=1; i<=n;i++){
		if (c[i]<k){
			q.push(i);
			ans--;
			seen[i]=true; 
		}
	}
	while (!q.empty()){
		int v=q.front();
		q.pop();
		 for (int edge:g[v]){
			 if (!seen[edge]){
				 c[edge]--;
				 if (c[edge]<k){
					 q.push(edge);
					 seen[edge]=true; 
				 	ans--;
				 }
			 }
		 }
	}
	cout<<ans<<endl; 
	for (int i=1; i<=n;i++){
		if (!seen[i]) cout<<i<<" "; 
	}
}