#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

vector<vector<ll>> adj;

vector<ll> calc_d(ll n) {
  vector<ll> d(adj.size(), LLINF); d[n] = 0;
  queue<ll> q; q.push(n);
  while (q.size()) {
    ll now = q.front(); q.pop();
    for (auto x: adj[now]) {
      if (d[x]==LLINF) {
        q.push(x);
        d[x] = d[now]+1;
      }
    }
  }
  return d;
}

int main() {
  ll N, M, P; cin >> N >> M >> P;
  ll S, G; cin >> S >> G; S--; G--;

  adj.resize(N*2);
  rep(i,M) {
    ll u, v; cin >> u >> v; u--; v--;
    adj[u].push_back(v+N); adj[v+N].push_back(u);
    adj[v].push_back(u+N); adj[u+N].push_back(v);
  }
  vector<ll> ds = calc_d(S), dg = calc_d(G);
  // rep(i,N) cout << ds[i] << " "; cout << endl;
  // rep(i,N) cout << ds[i+N] << " "; cout << endl;

  vector<ll> result;
  rep(i,N) {
    if (P%2==0) {
      ll md = min(ds[i]+dg[i],ds[i+N]+dg[i+N]);
      if (md<=P) result.push_back(i+1);
    }
    else {
      ll md = min(ds[i]+dg[i+N],ds[i+N]+dg[i]);
      if (md<=P) result.push_back(i+1);      
    }
  }
  if (result.size()) {
    cout << result.size() << endl;
    for (auto x: result) cout << x << endl;
  }
  else cout << -1 << endl;
  return 0;
}