#include <bits/stdc++.h>
#include <chrono>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

template<class T> bool chmin(T &a, const T &b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T &b){
    if(a < b) {a = b; return true;}
    else return false;
}

void dijkstra(int s, vec &dist, mat &G){
    dist[s] = 0;
    priority_queue<P, vector<P>, greater<> > pque;
    pque.emplace(0, s);
    while(!pque.empty()){
        P p = pque.top(); pque.pop();
        if(dist[p.se] < p.fi) continue;
        for(ll to : G[p.se]){
            if(chmin(dist[to], p.fi + 1)){
                pque.emplace(dist[to], to);
            }
        }
    }
}

int main() {
    cin>>N>>M>>K;
    int s, g;
    cin>>s>>g;
    --s; --g;
    mat G(N, vec(0));
    rep(i,M){
        int u, v;
        cin>>u>>v;
        --u; --v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    vec dists(N, INF), distg(N, INF);
    dijkstra(s, dists, G);
    dijkstra(g, distg, G);
    vec ans(0);
    rep(i,N){
        //cout<<dists[i]<<' '<<distg[i]<<endl;
        if(K >= dists[i] + distg[i] && ((K&(dists[i] + distg[i]))&1)) ans.push_back(i);
    }
    int n = ans.size();
    if(n == 0){
        cout<<-1<<endl;
    }else{
        cout<<n<<endl;
        rep(i,n) cout<<ans[i] + 1<<endl;
    }
}