import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const P = readLong();
      const S = readInt() - 1;
      const T = readInt() - 1;
      auto A = new int[M];
      auto B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      
      auto graph = new int[][N << 1];
      foreach (i; 0 .. M) {
        graph[A[i] << 1 | 0] ~= (B[i] << 1 | 1);
        graph[A[i] << 1 | 1] ~= (B[i] << 1 | 0);
        graph[B[i] << 1 | 0] ~= (A[i] << 1 | 1);
        graph[B[i] << 1 | 1] ~= (A[i] << 1 | 0);
      }
      
      long[] bfs(int src) {
        DList!int que;
        auto dist = new long[N << 1];
        dist[] = INF;
        dist[src] = 0;
        que ~= src;
        for (; !que.empty; ) {
          const u = que.front;
          que.removeFront;
          foreach (v; graph[u]) {
            if (chmin(dist[v], dist[u] + 1)) {
              que ~= v;
            }
          }
        }
        return dist;
      }
      
      const dS = bfs(S << 1 | 0);
      const dT = bfs(T << 1 | 0);
      
      if (dS[T << 1 | cast(int)(P & 1)] <= P) {
        int[] ans;
        foreach (u; 0 .. N) {
          bool ok;
          foreach (x; 0 .. 2) foreach (y; 0 .. 2) {
            if ((x ^ y) == (P & 1) && dS[u << 1 | x] + dT[u << 1 | y] <= P) {
              ok = true;
            }
          }
          if (ok) {
            ans ~= u;
          }
        }
        writeln(ans.length);
        foreach (u; ans) {
          writeln(u + 1);
        }
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}