#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;

set<int> ans;
set<int> s;
bool f[101010];
void dfs(Graph &g, set<int> d, int v){
	if (s.find(v) != s.end()){
		for (int i : d){
			ans.insert(i);
		}
	}
	for (int i : g[v]){
		if (!f[i]){
			f[i] = true;
			d.insert(i);
			dfs(g, d, i);
			d.erase(i);
		}
	}
}

int main() {
	int n, m, p;
	cin >> n >> m >> p;
	int S, G;
	cin >> S >> G;
	S--;
	G--;
	Graph g(n);
	for (int i = 0; i < m; i++){
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	vector<int> d(n, -1);
	d[S] = 0;
	queue<int> q;
	q.push(S);
	while (!q.empty()){
		int v = q.front();
		q.pop();
		for (int i : g[v]){
			if (d[i] == -1){
				d[i] = d[v] + 1;
				q.push(i);
			}
		}
	}
	vector<int> d2(n, -1);
	d2[G] = 0;
	queue<int> q2;
	q2.push(G);
	while (!q2.empty()){
		int v = q2.front();
		q2.pop();
		for (int i : g[v]){
			if (d2[i] == -1){
				d2[i] = d2[v] + 1;
				q2.push(i);
			}
		}
	}
	for (int i = 0; i < n; i++){
		if (p % (d[i] + d2[i]) == 0){
			s.insert(i);
		}
	}
	set<int> D;
	D.insert(S);
	dfs(g, D, S);
	D.clear();
	D.insert(G);
	memset(f, 0, sizeof(f));
	dfs(g, D, G);
	if (ans.empty()){
		cout << -1 << endl;
		return 0;
	}
	cout << ans.size() << endl;
	for (int i : ans){
		cout << i + 1 << endl;
	}
}