#include <bits/stdc++.h>
using namespace std;

template<typename T, T INF>
vector<T> dijkstra(const vector<vector<pair<T, int>>> &g, int st = 0) {
  const int n = g.size();
  vector<T> dis(n, INF); {
    set<pair<T, int>> bag;
    bag.emplace(dis[st] = 0, st);
    while (bag.size()) {
      auto [d, u] = *bag.begin();
      bag.erase(bag.begin());
      if (d != dis[u]) continue;
      for (auto [w, v] : g[u]) {
        if (d + w < dis[v]) {
          bag.emplace(dis[v] = d + w, v);
        }
      }
    }
  }
  return dis;
}

int main() {
  ios::sync_with_stdio(false);

  int N, M, P; { cin >> N >> M >> P; }
  int S, G; { cin >> S >> G; --S, --G; }
  vector<vector<pair<int64_t, int>>> graph(2 * N); {
    for (int i = 0; i < M; ++i) {
      int U, V; { cin >> U >> V; --U, --V; }
      for (int p = 0; p < 2; ++p) {
        graph[U << 1 | p].emplace_back(1, V << 1 | !p);
        graph[V << 1 | p].emplace_back(1, U << 1 | !p);
      }
    }
  }

  vector<int> res; {
    const int64_t INF = (int64_t) 1 << 60;
    vector<int64_t> sdis = dijkstra<int64_t, INF>(graph, S << 1);
    vector<int64_t> gdis = dijkstra<int64_t, INF>(graph, G << 1);
    for (int t = 0; t < N; ++t) {
      for (int p = 0; p < 2; ++p) {
        int64_t sd, gd;
        if ((sd = sdis[t << 1 | p]) == INF) continue;
        if ((gd = gdis[t << 1 | (p ^ P & 1)]) == INF) continue;
        if (sd + gd > P) continue;
        res.push_back(t);
        break;
      }
    }
  }

  if (res.size()) {
    cout << res.size() << endl;
    for (int i = 0; i < res.size(); ++i) cout << res[i] + 1 << "\n";
  } else cout << -1 << endl;
}