#include <iostream>
#include <bits/stdc++.h>
#include<queue>

using namespace std;

int main()
{
    int n, m, k, a, b;
    cin>>n>>m>>k;
    vector<int> hal(k);
    vector<vector<int>> cs(n+1);
    vector<int> erdos(n+1, -1);
    vector<bool> alap(n+1, false);
    vector<bool> been(n+1, false);
    queue<int> q;
    vector<int> d;
    bool jaj=true;
    for(int i=0; i<k; i++){
        cin>>hal[i];
        alap[hal[i]]=true;
    }
    alap[hal[0]]=false;
    for(int i=0; i<m; i++){
        cin>>a>>b;
        cs[a].push_back(b);
        cs[b].push_back(a);
    }
    for(int h=1; h<n+1; h++){

            if(alap[h])
                continue;
            erdos[h]=0;
            been[h]=true;
            for(auto x:cs[h]){
                q.push(x);
                erdos[x]=1;
            }
            while(q.size()>0){
                if(!been[q.front()]){
                        been[q.front()]=true;
                    for(auto x:cs[q.front()]){
                        if(erdos[x]==-1){
                            erdos[x]=erdos[q.front()]+1;
                            q.push(x);
                        }
                    }
                }
                q.pop();
            }
            for(int i=0; i<k-1; i++){
                if(erdos[hal[i]]+1<erdos[hal[i+1]]){
                    jaj=false;
                    break;
                }
            }

            if(!jaj){
                    continue;
                }
            for(auto x:erdos){
                    if(x!=-1){
                if(!alap[x]&&x<erdos[hal.back()]&&x>erdos[hal[0]]){
                    jaj=false;
                    break;

                }
                }
            }
            if(jaj){
                d.push_back(h);
            }
            jaj=true;
            erdos.assign(n+1, -1);
            been.assign(n+1, false);
    }
    cout<<d.size()<<endl;
    for(auto x:d){
        cout<<x<<" ";
    }
    /*cout<<endl<<erdos.size()<<endl;
    for(auto x:erdos){
        cout<<x<<" ";
    }*/

}