/*
 * ============================
 * @Author: feng_Lrefrain
 * @DateTime: 2024-11-13 16:38:31
 * ============================
 */
#include <bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define rep(I,S,N) for(int I=(S);I<(N);++I)
#define per(I,S,N) for(int I=(N)-1;I>=(S);--I)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef double db;
//int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
//inline ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
//inline ll lcm(ll a,ll b) {return a/gcd(a,b)*b;}
//inline ll ksm(ll a,ll b,ll p) {ll ans=1;while(b){if(b&1)ans=(ans*a)%p;b>>=1;a=(a*a)%p;}return ans%p;}
//inline ll lowbit(int x) {return x&(-x);}
//inline int read() {
//    int x = 0;
//    char ch = getchar();
//    while (ch < '0' || ch > '9') ch = getchar();
//    while (ch <= '9' && ch >= '0') {
//        x = (x << 1) + (x << 3) + (ch ^ 48);
//        ch = getchar();
//    }
//    return x;
//}
const int N = 2e5 + 10, M = 998244353, MM = 1e9 + 7, inf = 1e18;

void solve() {
	int n, m, k; cin >> n >> m >> k;
	map<int, int> mp, mp1;
	vector<vi> a(n + 1);
	rep(i, 0, k) {
		int tmp; cin >> tmp;
		mp[tmp] = 1;
	}
	rep(i, 0, m) {
		int u, v; cin >> u >> v;
		if (!mp[u]) {
			if (!mp1[v]) {
				a[u].pb(v);
				mp1[v] = 1;
			}
		}
	}
	int sum = 0, cnt = 0;
	rep(i, 1, n + 1) {
		if (SZ(a[i])) {
			sum += SZ(a[i]);
			cnt ++;
		}
	}
	cout << sum << '\n';
	if (sum + cnt < n) {
		cout << "No\n";
		return;
	}
	cout << "Yes\n" << cnt << '\n';
	rep(i, 1, n + 1) {
		if (SZ(a[i])) {
			cout << i << " " << SZ(a[i]) << " ";
			for (auto &j : a[i]) {
				cout << j << " ";
			}
		}
		cout << '\n';
	}
}
/*


*/
signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int _ = 1;
	// cin >> _;
	while (_ --) {
		solve();
	}
	return 0;
}