#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
 
struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}

template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
    is>>p.first>>p.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int n,m,p;cin>>n>>m>>p;
    int s,t;cin>>s>>t;s--,t--;
    vector<vector<int>> g(n);
    rep(i,m){
        int u,v;cin>>u>>v;u--,v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    using P=pair<int,int>;

    vector<vector<int>> ds(n,vector<int>(2,INF)),dt(n,vector<int>(2,INF));

    auto fi=[&](int st,vector<vector<int>> &d){
        queue<P> que;
        d[st][0]=0;
        que.push(P(st,0));
        while(!que.empty()){
            auto [now,p]=que.front();que.pop();
            for(auto to:g[now]){
                if(chmin(d[to][p^1],d[now][p]+1)) que.push(P(to,p^1));
            }
        }
    };

    fi(s,ds);
    fi(t,dt);

    vector<int> ans;
    rep(i,n){
        if(p%2){
            // odd
            if(ds[i][0]+dt[i][1]<=p or ds[i][1]+dt[i][0]<=p)ans.push_back(i);
        }else{
            if(ds[i][0]+dt[i][0]<=p or ds[i][1]+dt[i][1]<=p)ans.push_back(i);
        }
    }
    if(ans.empty())cout<<-1<<endl;
    else{
        cout<<ans.size()<<endl;
        for(auto x:ans)cout<<x+1<<endl;
    }
    return 0;
}