#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=1444999999994;
ll mod=1000000007;
int main(){
    ll n,m,p;
    cin >> n >> m >> p;
    ll s,gg;
    cin >> s >> gg;
    s--,gg--;
    vector<vector<ll>>g(n);
    for (ll i = 0; i < m; i++)
    {
        ll a,b;
        cin >> a >> b;
        a--,b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    vector<ll>a(n,inf),b(n,inf);
    a[s]=0;
    queue<ll>que;
    que.push(s);
    vector<ll>memo(n,0);
    while (!que.empty())
    {
        ll v=que.front();
        que.pop();
        memo[v]=0;
        for (ll i = 0; i < g[v].size(); i++)
        {
            if (a[g[v][i]]>b[v]+1)
            {
                a[g[v][i]]=b[v]+1;
                if (memo[g[v][i]]==0)
                {
                    que.push(g[v][i]);
                    memo[g[v][i]]=1;
                }
            }
            if (b[g[v][i]]>a[v]+1)
            {
                b[g[v][i]]=a[v]+1;
                if (memo[g[v][i]]==0)
                {
                    que.push(g[v][i]);
                    memo[g[v][i]]=1;
                }
            }
        }
    }
    vector<ll>aa(n,inf),bb(n,inf);
    aa[gg]=0;
    que.push(gg);
    while (!que.empty())
    {
        ll v=que.front();
        que.pop();
        memo[v]=0;
        for (ll i = 0; i < g[v].size(); i++)
        {
            if (aa[g[v][i]]>bb[v]+1)
            {
                aa[g[v][i]]=bb[v]+1;
                if (memo[g[v][i]]==0)
                {
                    que.push(g[v][i]);
                    memo[g[v][i]]=1;
                }
            }
            if (bb[g[v][i]]>aa[v]+1)
            {
                bb[g[v][i]]=aa[v]+1;
                if (memo[g[v][i]]==0)
                {
                    que.push(g[v][i]);
                    memo[g[v][i]]=1;
                }
            }
        }
    }
    vector<ll>ans;
    for (ll i = 0; i < n; i++)
    {
        if (p%2)
        {
            if (a[i]+bb[i]<=p||b[i]+aa[i]<=p)
            {
                ans.push_back(i);
            }
        }else{
            if (a[i]+aa[i]<=p||b[i]+bb[i]<=p)
            {
                ans.push_back(i);
            }
        }
    }
    if (ans.empty())
    {
        cout << -1 << endl;
        return 0;
    }
    
    cout << ans.size() << endl;
    for (ll i = 0; i < ans.size(); i++)
    {
        cout << ans[i]+1 << endl;
    }
    
}