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

signed main() {
    int n,m,k; cin >> n >> m >> k;
    vector<vector<bool>> x(n+1, vector<bool>(2));
    vector<vector<int>> y(n+1, vector<int>(2));
    vector<vector<int>> g(n+1);
    vector<int> time(1000000);	
    queue<int> q;
    for(int i = 0; i < k; i++) {
        int a; cin >> a;
        x[a][0] = true;
        y[a][0] = 1;
        q.push(a);
    }
    for(int i = 0; i < m; i++) {
        int a,b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    while(q.size() != 0) {
        int v = q.front();  q.pop();
        if(x[v][0] == true) {
            for(int i : g[v]) {
                if(x[i][1] == false) {
                    y[i][1] = y[v][0]+1;
                    x[i][1] = true;
                    q.push(i);
                }
            }
        }
        if(x[v][1] == true) {
            for(int i : g[v]) {
                if(x[i][0] == false) {
                    y[i][0] = y[v][1]+1;
                    x[i][0] = true;
                    q.push(i);
                }
            }
        }
    }
    int one=0,two=0;
    long long o=0,t=0;
    for(int i = 1; i <= n; i++) {
        if(x[i][0]) {
            one++;
            o=max(o,y[i][0]);
            time[y[i][0]]++;
        }
        if(x[i][1]) {
            two++;
            t=max(t,y[i][1]);
            time[y[i][1]]++;
        }
    }
    for(int i = 3; i < (int)time.size(); i++) {
        time[i] += time[i-2];
    }
    if(one > two || (one == two && o < t)) {
        cout << one << endl << o << endl;
        for(int i = 1; i <= o; i++) {
            cout << time[i] << " ";
        }
    }
    else {
        cout << two << endl << t << endl;
        for(int i = 1; i <= t; i++) {
            cout << time[i] << " ";
        }
    }
}