#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define fs first
#define sc second

const ll MOD = 1e9+7;

void solve()
{
	ll n, m, k;
	cin >> n >> m >> k;
	vector<vector<ll>> g(n);
	for(ll i = 0; i < m; i++)
	{
		ll a, b;
		cin >> a >> b;
		a--; b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	set<ll> ans, ans2, wa;
	for(ll i = 0; i < n; i++)
		if(g[i].size() >= k)
			ans.insert(i);
	
	for(ll i : ans)
	{
		ll ok = 0;
		for(ll j = 0; j < g[i].size(); j++)
			if(count(ans.begin(), ans.end(), g[i][j]) && !count(wa.begin(), wa.end(), g[i][j]))
				ok++;
		if(ok >= k)
			ans2.insert(i);
		else
		 	wa.insert(i);
	}
	for(ll i : ans)
	{
		ll ok = 0;
		for(ll j = 0; j < g[i].size(); j++)
			if(count(ans.begin(), ans.end(), g[i][j]) && !count(wa.begin(), wa.end(), g[i][j]))
				ok++;
		if(ok >= k)
			ans2.insert(i);
		else
		 	wa.insert(i);
	}

	cout << ans2.size() << endl;
	for(ll i : ans2)
		cout << i+1 << " ";
	cout << endl;
}

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