#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

// g <- pair < v , cost > 
template < class T >
vector< T > dijkstra(vector<vector<pair<int, T>>> &graph, int s) {
    T INF = numeric_limits< T >::max();
    vector<T> dist(graph.size(), INF);
    priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;
    q.push({dist[s] = T(0), s});
    while(!q.empty()){
        auto [uc, ui] = q.top(); q.pop();
        if(uc != dist[ui]) continue;
        for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) 
            q.push({dist[vi] = uc + vc, vi});
    }
    return dist;
}


int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,M,P; cin >> N >> M >> P;
    int S,G; cin >> S >> G; S--; G--;
    vector<vector<pair<int,int>>> H(N * 2);
    auto h = [&](int v, int p) { return v * 2 + p; };
    rep(_,M) {
        int u,v; cin >> u >> v; u--; v--;
        for(int p : {0, 1}) {
            H[h(u, p)].push_back({h(v, 1 - p), 1});
            H[h(v, p)].push_back({h(u, 1 - p), 1});
        }
    }

    auto distS = dijkstra(H, h(S, 0));
    auto distG = dijkstra(H, h(G, 0));
    vector<int> ans;
    int INF = numeric_limits<int>::max();
    rep(i,N) {
        int ok = 0;
        for(int ps : {0, 1}) for(int pg : {0, 1}) {
            int ds = distS[h(i, ps)];
            int dg = distG[h(i, pg)];
            ok |= (ds != INF && dg != INF && ds + dg <= P && (ds + dg) % 2 == P % 2);
        }
        if(ok) ans.push_back(i);
    }

    if(ans.empty()) {
        cout << -1 << "\n";
    } else {
        cout << ans.size() << "\n";
        for(int a : ans) cout << a + 1 << "\n";
    }
}