#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define mod 998244353

using namespace std;
typedef pair<llint, llint> P;

llint n, m, p;
llint s, g;
vector<llint> G[200005];
llint distS[200005], distG[200005];

void bfs(vector<llint> G[], int S, llint dist[])
{
	queue<int> Q;
	Q.push(S);
	
	for(int i = 1; i <= 2*n; i++) dist[i] = inf;
	dist[S] = 0;
	
	while(Q.size()){
		int v = Q.front();
		Q.pop();
		for(int i = 0; i < G[v].size(); i++){
			if(dist[G[v][i]] < inf/2) continue;
			Q.push(G[v][i]);
			dist[G[v][i]] = dist[v] + 1;
		}
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> p;
	cin >> s >> g;
	
	llint u, v;
	for(int i = 1; i <= m; i++){
		cin >> u >> v;
		G[u].push_back(v+n);
		G[v].push_back(u+n);
		G[u+n].push_back(v);
		G[v+n].push_back(u);
	}
	
	bfs(G, s, distS);
	bfs(G, g, distG);
	
	if(distS[p%2*n + g] > p){
		cout << -1 << endl;
		return 0;
	}
	
	vector<llint> ans;
	for(int i = 1; i <= n; i++){
		bool flag = false;
		if(distS[i] + distG[p%2*n+i] <= p) flag = true;
		if(distS[n+i] + distG[(p+1)%2*n+i] <= p) flag = true;
		if(flag) ans.push_back(i);
	}
	
	cout << ans.size() << "\n";
	for(int i = 0; i < ans.size(); i++) cout << ans[i] << "\n";
	flush(cout);
	
	return 0;
}