#define MOD_TYPE 2 #pragma region Macros #include using namespace std; #if 0 #include #include using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif using ll = long long int; using ld = long double; using pii = pair; using pll = pair; using pld = pair; template using smaller_queue = priority_queue, greater>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr double PI = acos(-1.0); constexpr double EPS = 1e-7; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; struct io_init { io_init() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template constexpr istream &operator>>(istream &is, pair &p) noexcept { is >> p.first >> p.second; return is; } template constexpr ostream &operator<<(ostream &os, pair &p) noexcept { os << p.first << " " << p.second; return os; } #pragma endregion void solve() { int n, m, p, s, g; cin >> n >> m >> p >> s >> g; s--, g--; vector> E(n); rep(i, m) { int u, v; cin >> u >> v; u--, v--; E[u].push_back(v); E[v].push_back(u); } vector ds(n, vector(2, INF)); vector dg(n, vector(2, INF)); { queue que; que.push({s, 0}); ds[s][0] = 0; while (!que.empty()) { auto [v, t] = que.front(); que.pop(); for (auto to : E[v]) { if (ds[to][t ^ 1] != INF) continue; ds[to][t ^ 1] = ds[v][t] + 1; que.push({to, t ^ 1}); } } } { queue que; que.push({g, 0}); dg[g][0] = 0; while (!que.empty()) { auto [v, t] = que.front(); que.pop(); for (auto to : E[v]) { if (dg[to][t ^ 1] != INF) continue; dg[to][t ^ 1] = dg[v][t] + 1; que.push({to, t ^ 1}); } } } vector ans; rep(i, n) { if (p % 2 == 0) { if (ds[i][0] + dg[i][0] <= p or ds[i][1] + dg[i][1] <= p) ans.push_back(i); } else { if (ds[i][0] + dg[i][1] <= p or ds[i][1] + dg[i][0] <= p) ans.push_back(i); } } if (ans.empty()) { cout << -1 << "\n"; return; } cout << ans.size() << "\n"; for (auto a : ans) cout << a + 1 << "\n"; } int main() { solve(); }