#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m, p, s, g; cin >> n >> m >> p >> s >> g; --s; --g;
  vector<vector<int>> graph(n);
  while (m--) {
    int u, v; cin >> u >> v; --u; --v;
    graph[u].emplace_back(v);
    graph[v].emplace_back(u);
  }
  auto solve = [&](int from) {
    vector dist(n, vector(2, INF));
    using P = pair<int, pair<int, int>>;
    priority_queue<P, vector<P>, greater<P>> que;
    dist[from][0] = 0;
    que.emplace(0, make_pair(from, 0));
    while (!que.empty()) {
      auto [cost, pr] = que.top(); que.pop();
      auto [i, j] = pr;
      if (cost > dist[i][j]) continue;
      for (int e : graph[i]) {
        int d = dist[i][j] + 1;
        if (d < dist[e][d & 1]) {
          dist[e][d & 1] = d;
          que.emplace(d, make_pair(e, d & 1));
        }
      }
    }
    return dist;
  };
  auto dist_s = solve(s), dist_g = solve(g);
  vector<int> ans;
  REP(v, n) {
    bool ch = false;
    REP(i, 2) REP(j, 2) ch |= p % 2 == (i + j) % 2 && dist_s[v][i] + dist_g[v][j] <= p;
    if (ch) ans.emplace_back(v);
  }
  if (ans.empty()) {
    cout << "-1\n";
  } else {
    cout << ans.size() << '\n';
    for (int e : ans) cout << e + 1 << '\n';
  }
  return 0;
}