#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, p, s, g;
    cin >> n >> m >> p >> s >> g;
    --s, --g;
    vector<vector<int>> graph(n);
    for(int i = 0; i < m; ++i){
        int u, v;
        cin >> u >> v;
        --u, --v;
        graph[u].emplace_back(v);
        graph[v].emplace_back(u);
    }

    vector<int> dist(n, INF);
    queue<int> que;
    dist[s] = 0;
    que.emplace(s);
    while(!que.empty()){
        int from = que.front();
        que.pop();
        for(int to : graph[from]){
            if(chmin(dist[to], dist[from] + 1)){
                que.emplace(to);
            }
        }
    }

    vector<int> dist2(n, INF);
    dist2[g] = 0;
    que.emplace(g);
    while(!que.empty()){
        int from = que.front();
        que.pop();
        for(int to : graph[from]){
            if(chmin(dist2[to], dist2[from] + 1)){
                que.emplace(to);
            }
        }
    }

    vector<int> ans;
    for(int v = 0; v < n; ++v){
        if(dist[v] + dist2[v] <= p && (p - dist[v] - dist2[v]) % 2 == 0){
            ans.emplace_back(v);
        }
    }

    if(ans.size() == 0) cout << -1 << '\n';
    else{
        cout << ans.size() << '\n';
        for(int v : ans)    cout << v + 1 << '\n';
    }

    return 0;
}