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

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

tem T>
string _ARR_(T* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9 + 7, N = 100005;

int cur=1, n, m, k;
ar<int,2> c, vis[N];
vector<int> adj[N];

int main()
{
	FAST;
	cin >> n >> m >> k;
	vector<int> f(k);

	fill(vis, vis+n, ar<int,2>{0,0});
	c = {0, 0};

	for(int i = 0; i < k; ++i){
		cin >> f[i];
		c[cur%2] += vis[f[i]][cur%2] = 1;
	}

	for(int i = 0; i < m; ++i){
		int u, v; cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	int c0 = 0;
	for(int x : f) if(adj[x].size() == 0) ++c0;

	vector<int> ans;
	ans.reserve(4*N);

	while(f.size()){
		ans.pb(c[cur%2]);
		if(c0){
			c[1] -= c0;
			c0 = 0;
		}
		if(ans.back() == n) break;
		vector<int> nf;
		++cur;
			
		for(int u : f){
			for(int v : adj[u]){
				if(!vis[v][cur%2]){
					nf.pb(v);
					c[cur%2] += vis[v][cur%2] = 1;
				}
			}
		}
		swap(f, nf);
	}

	int mx=0, mxpos=-1;

	for(int i = 0; i < ans.size(); ++i){
		if(ans[i] > mx){
			mx = ans[i];
			mxpos = i;
		}
	}

	cout << mx << '\n' << mxpos+1 << '\n';
	for(int i = 0; i <= mxpos; ++i) cout << ans[i] << ' ';

	return 0;
}