#include <iostream>
#include <queue>
#define ll long long

using namespace std;

struct adat
{
    int lat, lep;
    vector<ll>sz;
};

vector<adat>x;
deque<ll>v;
vector<int>ism;
vector<int>megold;

int n, m, k, i, a, b, kezd, akt, db;

void bejar(vector<adat>& x, deque<ll>& v, int& db, vector<int>ism, int& kezd, int k, vector<int>& megold)
{
    int i;

    v.push_back(kezd);
    x[kezd].lat = 1;
    x[kezd].lep = 0;

    while (!v.empty())
    {
        akt = v.front();
        v.pop_front();

        for (auto& e : x[akt].sz)
        {
            if (!x[e].lat)
            {
                v.push_back(e);
                x[e].lat = 1;
                x[e].lep = x[akt].lep + 1;
            }
        }
    }

    //for (i = 1; i <k; ++i)
    //{
    //    //if (x[ism[i]].lep <= x[ism[i + 1]].lep)
    //    //{
    //    //    /*++db;
    //    //    megold.push_back(kezd);*/
    //    //    cout << x[ism[i]].lep<<" ";
    //    //}

    //    
    //}
    cout << kezd << "\n";

    for (i = 1; i <= n; ++i)
    {
        cout << x[i].lep << " ";
    }
    cout << "\n";
}

int main()
{
    cin >> n >> m >> k;

    x.resize(n + 1);

    ism.resize(k + 1);

    for (i = 1; i <= k; ++i)
    {
        cin >> ism[i];
    }

    for (i = 1; i <= m; ++i)
    {
        cin >> a >> b;

        x[a].sz.push_back(b);
        x[b].sz.push_back(a);
    }

    cout << "\n";
    for (i = 1; i <= n; ++i)
    {
        cout << i << " ";
    }
    cout << "\n";

    for (i = 1; i <= n; ++i)
    {
        bejar(x, v, db, ism, i, k, megold);
    }

    /*cout << "\n";
    cout << db << "\n";


    for (auto& e : megold)
    {
        cout << megold[e]<<" ";
    }*/
}