/* -*- coding: utf-8 -*-
 *
 * 1190.cc:  No.1190 Points - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_N2 = MAX_N * 2;
const int INF = (1 << 30) - 1;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

vi nbrs[MAX_N];
int sds[MAX_N2], gds[MAX_N2], vs[MAX_N];

/* subroutines */

void bfs(int n, int st, int ds[]) {
  n <<= 1, st <<= 1;
  fill(ds, ds + n, INF);
  ds[st] = 0;

  qi q;
  q.push(st);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    int ui = (u >> 1), up = (u & 1);
    int vd = ds[u] + 1, vp = (vd & 1);

    vi &nbru = nbrs[ui];
    for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int v = ((*vit << 1) | vp);
      if (ds[v] > vd) {
	ds[v] = vd;
	q.push(v);
      }
    }
  }
}

/* main */

int main() {
  int n, m, p, st, gl;
  scanf("%d%d%d%d%d", &n, &m, &p, &st, &gl);
  st--, gl--;

  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  bfs(n, st, sds);
  bfs(n, gl, gds);
  
  int k = 0;
  for (int v = 0; v < n; v++) {
    int v0 = (v << 1), v1 = v0 | 1;
    int d = 0;
    if (p & 1)
      d = min(sds[v0] + gds[v1], sds[v1] + gds[v0]);
    else
      d = min(sds[v0] + gds[v0], sds[v1] + gds[v1]);
    if (d <= p) vs[k++] = v;
  }

  if (k > 0) {
    printf("%d\n", k);
    for (int i = 0; i < k; i++) printf("%d\n", vs[i] + 1);
  }
  else
    puts("-1");
  return 0;
}