#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const ll maxN = 2e5 + 5;
const ll MOD = 1e9 + 7;


int main() {
    /*freopen("../input.txt", "r", stdin);
    freopen("../output.txt", "w", stdout);*/
   InTheNameOfGod;
    
    ll n,m,k;
    cin >> n >> m >> k;

    vector<vector<ll> > g(n+1), tav(n+1, vector<ll>(2, -1));
    vector<ll> a(k);

    for(ll &i : a) cin >> i;

    for(ll i = 0; i < m; i++) {
        ll x,y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    vector<vector<ll> > pref(2*n+1, vector<ll>(2, 0));
    queue<pair<ll, ll >> sor;

    for(ll i = 0; i < k; i++) {
        if(!g[a[i]].empty()) {
            tav[a[i]][0] = 1;
            pref[1][0]++;
            sor.push({a[i], 0});
        }
        else {
            pref[1][0]++;
            pref[3][0]--;
            //cout << "empty: " << a[i] << endl;
        }
    }

    while(!sor.empty()) {
        pair<ll, ll> cur = sor.front();
        sor.pop();

        //cout << cur.first << ", " << cur.second << ": " << tav[cur.first][cur.second] << endl;

        for(ll sz : g[cur.first]) {
            if(tav[sz][1-cur.second] != -1) continue;
            tav[sz][1-cur.second] = tav[cur.first][cur.second] + 1;
            pref[tav[sz][1-cur.second]][1-cur.second]++;
            sor.push({sz, 1-cur.second});
        }
    }

    /*for(ll i = 1; i < 7; i++) cout << pref[i][0] << ' ';
    cout << endl;
    for(ll i = 1; i < 7; i++) cout << pref[i][1] << ' ';
    cout << endl;*/

    vector<ll> mo(2*n+1, 0);
    ll maxi = -1, ind = -1;
    for(ll i = 1; i < pref.size(); i++) { 
        mo[i] = pref[i][1-i%2];

        if(i > 2) mo[i] += mo[i-2];

        if(mo[i] > maxi) {
            maxi = mo[i];
            ind = i;
        }
    }

    cout << maxi << "\n" << ind << "\n";
    for(ll i = 1; i <= ind; i++) cout << mo[i] << ' ';
    cout << "\n";

    return 0;
}