n, m, p = map(int, input().split())
s, g = map(int, input().split())
s -= 1
g -= 1
to = [[] for _ in range(n)]
for _ in range(m):
    u, v = map(int, input().split())
    to[u-1].append(v-1)
    to[v-1].append(u-1)

INF = 10**18
dist_s = [[INF, INF] for _ in range(n)]
dist_s[s][0] = 0
q = [s]
now = 1
while q:
    nq = []
    for u in q:
        for v in to[u]:
            if now < dist_s[v][now&1]:
                dist_s[v][now&1] = now
                nq.append(v)
    q = nq
    now += 1

dist_g = [[INF, INF] for _ in range(n)] 
dist_g[g][0] = 0
q = [g]
now = 1
while q:
    nq = []
    for u in q:
        for v in to[u]:
            if now < dist_g[v][now&1]:
                dist_g[v][now&1] = now
                nq.append(v)
    q = nq
    now += 1

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