def main3():
    N, M, Dep, Arr = map(int, input().split())
    metro = []
    Dep_index = set()
    Arr_index = set()
    for i in range(N):
        asd = list(map(int, input().split()))

        metro.append(set(asd[1:]))
        if Dep in metro[i]:
            Dep_index.add(i)
        if Arr in metro[i]:
            Arr_index.add(i)
        if i in Arr_index and i in Dep_index:
            print(1)
            print(i+1)
            return

    graph=[[] for i in range(N)]

    for i in range(N-1):
        for j in range(i+1, N):
            if not metro[i].isdisjoint(metro[j]):
                graph[i].append(j)
                graph[j].append(i)

    touched = Dep_index.copy()
    current_res = [0]*N
    for i in Dep_index:
        current_res[i]=-1
    while Dep_index:
        tmp=[]
        for i in Dep_index:
            for j in graph[i]:
                if j not in touched:
                    tmp.append(j)
                    touched.add(j)
                    current_res[j]=i
                    if j in Arr_index:
                        #print(len(current_res[j]))
                        #for x in current_res[j]:
                        #    print(x+1, end=" ")
                        res=[j]
                        while current_res[j] != -1:
                            j=current_res[j]
                            res.append(j)
                        print(len(res))
                        for x in range(len(res)-1,-1,-1):
                            print(res[x]+1, end=" ")
                        #print(j+1)
                        return
        Dep_index=tmp

    print("-1")

main3()