玄关求条

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+100;
bool vis[maxn],vis2[maxn];
int fa[maxn],r[maxn];
vector<int>g[maxn];
int find(int x){
	if(fa[x] == x)return x;
	return fa[x] = find(fa[x]);
}
void dfs(int x,int f){
	if(vis[x])return ;
	vis2[x] = 1;
	cout<<x<<" ";
	int cnt = 0;
	int siz = g[x].size();
	for(int i = 0;i<siz;i++){
		if(g[x][i] == f || vis2[g[x][i]])continue;
		cnt++;
	}
	cout<<cnt<<" ";
	for(int i = 0;i<siz;i++){
		if(g[x][i] == f || vis2[g[x][i]])continue;
		cout<<g[x][i]<<" ";
		vis2[g[x][i]] = 1;
	}
	cout<<'\n';
	for(int i = 0;i<siz;i++){
		if(g[x][i] == f || vis2[g[x][i]])continue;
		dfs(g[x][i],x);
	}
	return ;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0); 
	int n,m,k,x,y;
	cin>>n>>m>>k;
	for(int i = 1;i<=k;i++){
		cin>>x;
		vis[x] = 1;
	} 
	for(int i = 1;i<=n;i++)fa[i] = i,r[i] = 1;
	for(int i = 1;i<=m;i++){
		cin>>x>>y;
		g[x].push_back(y);
		g[y].push_back(x); 
		if(!vis[x] && !vis[y] && find(x) != find(y)){
			r[find(y)]+=r[find(x)];
			fa[find(x)] = find(y);
		}else if(find(x) != find(y) && (!vis[x] || !vis[y])){
			if(!vis[x])r[find(x)]++,fa[y] = find(x);
			else r[find(y)]++,fa[x] = find(y);
		}
	}
	int ans = 0,id = -1; 
	for(int i = 1;i<=n;i++){
		if(!vis[i] && find(i) == i && r[i]>ans){
			ans = r[i];
			id = i;
		}
	}
	if(ans == n){
		cout<<"Yes\n";
		dfs(id,0);
	}else cout<<"No";
	return 0;
}