# O(?)

from sys import stdin
input=stdin.readline

def solv():
    N,M,K = [int(x) for x in input().split()]
    F = [int(x)-1 for x in input().split()]
    graph=[[] for i in range(N)]
    for i in range(M):
        A,B = [int(x) for x in input().split()]
        graph[A-1].append(B-1)
        graph[B-1].append(A-1)
    #print(graph,N,M,K,F)

    def teszt(v):
        #print('v:',v)
        seen=[0]*N
        seen[v]=1
        cur=[v]
        index=0
        if F[0]==v:
            index=1
        while cur:
            #print('cur:',cur,index)
            tmp=set()
            for v in cur:
                for w in graph[v]:
                    if seen[w]==0:
                        seen[w]=1
                        tmp.add(w)
            oldindex=index
            while index<K and F[index] in tmp:
                index+=1
            #print('tmp:',tmp,oldindex,index)
            if index==K:
                return True
            if index==oldindex and oldindex!=0:
                return False
            cur=tmp
        return False
    res=''
    db=0
    for i in range(N):
        if teszt(i):
            db+=1
            res+=str(i+1)+' '
    print(db)
    print(res)
    
solv()