#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e17;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll n;
void calc(vvl &g,vl &dp,ll s){
    queue<ll> que;que.push(s);
    rep(i,n*2)dp[i]=INF;
    dp[s]=0;
    while(!que.empty()){
        ll v=que.front();que.pop();
        for(auto p:g[v%n]){
            ll nt=p;if(v<n)nt+=n;
            if(dp[nt]!=INF)continue;
            dp[nt]=dp[v]+1;
            que.push(nt);
        }   
    }
}
int main(){
    ll m,p;cin >> n >> m >> p;
    ll S,G;cin >> S >> G;S--;G--;
    vvl g(n);
    rep(i,m){
        ll a,b;cin >> a >> b;a--;b--;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    vl dp(n*2),ep(n*2);
    calc(g,dp,S);
    calc(g,ep,G);
    bool ok=false;
    if(dp[G]<=p&&p%2==0)ok=true;
    if(dp[G+n]<=p&&p%2==1)ok=true;
    if(!ok)cout << -1 << endl,exit(0);
    vl ans;
    rep(i,n){
        bool ret=false;
        rep(x,2){
            rep(y,2){
                if(dp[x*n+i]+ep[y*n+i]<=p&&(x+y)%2==p%2){
                    ret=true;
                }
            }
        }
        if(ret)ans.emplace_back(i);
    }
    cout << ans.size() << endl;
    for(auto p:ans)cout << p+1 << endl;
}