mod = 1000000007
eps = 10**-9


def main():
    import sys
    from collections import deque
    input = sys.stdin.buffer.readline

    N, M, P = map(int, input().split())
    S, G = map(int, input().split())
    adj = [[] for _ in range(N+1)]
    for _ in range(M):
        a, b = map(int, input().split())
        adj[a].append(b)
        adj[b].append(a)

    def dist(v0):
        que = deque()
        que.append(v0)
        seen = [10**10] * (N+1)
        seen[v0] = 0
        par = [0] * (N+1)
        child = [[] for _ in range(N+1)]
        seq = []
        V = set()
        while que:
            v = que.popleft()
            seq.append(v)
            for u in adj[v]:
                if seen[u] == 10**10:
                    seen[u] = seen[v] + 1
                    par[u] = v
                    child[v].append(u)
                    que.append(u)
                elif seen[u] == seen[v]:
                    V.add(u)
                    V.add(v)
                elif seen[u] == seen[v] + 1:
                    child[v].append(u)
        seq.reverse()
        add = [10**11] * (N+1)
        for v in V:
            add[v] = 1
            que.append(v)
            while que:
                vv = que.popleft()
                for u in child[vv]:
                    if add[u] == 1:
                        continue
                    que.append(u)
                    add[u] = 1

        while True:
            updated = 0
            for v in seq:
                val = 10**10
                for u in child[v]:
                    val = min(val, add[u] + 2)
                if add[v] != val:
                    updated = 1
                add[v] = val

            seq.reverse()
            for v in seq:
                for u in child[v]:
                    if add[u] > add[v]:
                        updated = 1
                    add[u] = min(add[u], add[v])
            seq.reverse()

            if not updated:
                break

        return seen, add

    ds, adds = dist(S)
    dg, addg = dist(G)
    ans = []
    for v in range(1, N+1):
        if ds[v] + dg[v] <= P:
            if (ds[v] + dg[v])%2 == P%2:
                ans.append(v)
            else:
                if ds[v] + dg[v] + min(adds[v], addg[v]) <= P:
                    ans.append(v)
    if ans:
        print(len(ans))
        for a in ans:
            print(a)
    else:
        print(-1)


if __name__ == '__main__':
    main()