#include <queue>
#include <vector>
#include <iostream>
using namespace std;
const int inf = 1012345678;
vector<vector<int> > get_sp(int src, vector<vector<int> > g) {
	vector<vector<int> > dist(g.size(), vector<int>(2, inf));
	dist[src][0] = 0;
	queue<pair<int, int> > que;
	que.push(make_pair(src, 0));
	while (!que.empty()) {
		pair<int, int> u = que.front(); que.pop();
		for (int i : g[u.first]) {
			if (dist[i][u.second ^ 1] == inf) {
				dist[i][u.second ^ 1] = dist[u.first][u.second] + 1;
				que.push(make_pair(i, u.second ^ 1));
			}
		}
	}
	return dist;
}
int main() {
	int N, M, P, S, G;
	cin >> N >> M >> P >> S >> G; --S, --G;
	vector<vector<int> > g(N);
	for (int i = 0; i < M; ++i) {
		int a, b;
		cin >> a >> b; --a, --b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	vector<vector<int> > ds = get_sp(S, g);
	vector<vector<int> > dg = get_sp(G, g);
	vector<int> cand;
	for (int i = 0; i < N; ++i) {
		int even_min = min(ds[i][0] + dg[i][0], ds[i][1] + dg[i][1]);
		int odd_min = min(ds[i][0] + dg[i][1], ds[i][1] + dg[i][0]);
		if (P % 2 == 0 && even_min <= P) cand.push_back(i);
		if (P % 2 == 1 && odd_min <= P) cand.push_back(i);
	}
	if (cand.empty()) {
		cout << -1 << endl;
	}
	else {
		cout << cand.size() << endl;
		for (int i : cand) {
			cout << i + 1 << endl;
		}
	}
	return 0;
}