#include <bits/stdc++.h>
using namespace std;

int n, m, k;
vector<int> ismert;
vector<vector<int>> graph;

bool valid(int root) {
    vector<int> dist(n + 1, -1), days_cnt;
    queue<int> q;
    dist[root] = 0;
    q.push(root);

    while (!q.empty()) {
        int sz = q.size();
        int cnt = 0;
        for (int i=0; i < sz; i++) {
            int node = q.front();
            q.pop();
            cnt++;
            for (int next : graph[node]) {
                if (dist[next] == -1) {
                    dist[next] = dist[node] + 1;
                    q.push(next);
                }
            }
        }
        days_cnt.push_back(cnt);
    }

    int start = INT_MAX;
    int finish = -1;

    for (int person : ismert) {
        days_cnt[dist[person]]--;
        start = min(start, dist[person]);
        finish = max(finish, dist[person]);
    }

    for (int i=1; i < ismert.size(); i++) {
        if (dist[ismert[i-1]] > dist[ismert[i]]) return false;
    }

    for (int i = start + 1; i < finish; i++) {
        if (days_cnt[i] > 0) return false;
    }

    return true;
}

int main() {
    cin >> n >> m >> k;
    ismert.assign(k, 0);
    graph.assign(n + 1, vector<int>());
    for (int i = 0; i < k; i++) {
        cin >> ismert[i];
    }
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    vector<int> res;
    for (int i=1; i <= n; i++) {
        if (valid(i)) {
            res.push_back(i);
        }
    }

    sort(res.begin(), res.end());

    cout << res.size() << '\n';
    for (int num : res) {
        cout << num << ' ';
    }

    return 0;
}