#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll d[2][111111][2];
vector<int> v[111111];
void bfs(int s,int k) {
  queue<P> que;
  que.push(P(s,0));
  d[k][s][0]=0;
  while(!que.empty()) {
    P p=que.front();que.pop();
    int x=p.F,c=p.S;
    rep(i,v[x].size()) {
      int y=v[x][i];
      if(d[k][y][(c+1)%2]==-1) {
        d[k][y][(c+1)%2]=d[k][x][c]+1;
        que.push(P(y,(c+1)%2));
      }
    }
  }
}

void Main() {
  ll n,m,k,s,t;
  cin >> n >> m >> k >> s >> t;
  s--,t--;
  rep(i,m) {
    int x,y;
    cin >> x >> y;
    x--,y--;
    v[x].pb(y);
    v[y].pb(x);
  }
  memset(d,-1,sizeof(d));
  bfs(s,0);
  bfs(t,1);
  set<int> se;
  rep(i,n) {
    rep(l,2) {
      rep(r,2) {
        if(d[0][i][l]!=-1&&d[1][i][r]!=-1&&d[0][i][l]+d[1][i][r]<=k&&(l+r)%2==k%2) se.in(i);
      }
    }
  }
  if(!se.size()) {
    pr(-1);
    return;
  }
  pr(se.size());
  tr(it,se) pr(*it+1);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}