import sys
from collections import deque

input = sys.stdin.buffer.readline

N, M, P = map(int, input().split())
S, G = (int(x) - 1 for x in input().split())
Graph = [[] for _ in range(N)]
for _ in range(M):
    u, v = (int(x) - 1 for x in input().split())
    Graph[u].append(v)
    Graph[v].append(u)

INF = 10 ** 9
pair2idx = lambda v, p: v + p * N
idx2pair = lambda v2: divmod(v2, N)


def dist_parity(v0):
    dist = [INF] * (2 * N)
    d = deque([v0])
    dist[v0] = 0
    while d:
        v2 = d.popleft()
        dv = dist[v2]
        parity, v = idx2pair(v2)
        for x in Graph[v]:
            x2 = pair2idx(x, 1 - parity)
            if dist[x2] == INF:
                dist[x2] = dv + 1
                d.append(x2)
    return dist


dist_s, dist_g = dist_parity(S), dist_parity(G)

ans = []
for i in range(N):
    if dist_s[pair2idx(i, 0)] + dist_g[pair2idx(i, P % 2)] <= P or dist_s[pair2idx(i, 1)] + dist_g[pair2idx(i, 1 - P % 2)] <= P:
        ans.append(i + 1)
if ans:
    print(len(ans))
    print(*ans, sep="\n")
else:
    print(-1)