#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define i128 __int128
using namespace std;
const int N = 1 << 20, mod = 1019260817, G = 19491001;
int n, rt;
vi son[N];

int s[N], fa[N], top;
int a[N], p[N];
void dfs(int x) {
	s[++top] = x;
	for(auto&v : son[x]) {
		fa[v] = x;
		dfs(v);
	}
}

int pw[N], SUM[N];
void chck_slv(int x) {
	SUM[x] = (pw[a[x]] + mod - pw[p[x]]) % mod;
	for(auto&v : son[x]) {
		chck_slv(v);
		(SUM[x] += SUM[v]) %= mod;
	}
}

bool chck() {
	vi np(n + 1);
	L(i, 1, n) 
		np[i] = a[i];
	chck_slv(rt);
	L(i, 2, n) {
		if(SUM[s[i]]) {
			swap(np[s[i]], np[fa[s[i]]]);
		}
	}
	L(i, 1, n) 
		if(np[i] != p[i]) 
			return 0;
	return 1;
}
int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> rt;
	L(i, 1, n) {
		cin >> a[i];
	}
	L(i, 1, n) {
		int k;
		cin >> k;
		while(k--) {
			int x;
			cin >> x;
			son[i].emplace_back(x);
		}
	}
	dfs(rt);
	L(i, 1, n) {
		cin >> p[i];
	}
	pw[0] = 1;
	L(i, 1, n) {
		pw[i] = (ll) pw[i - 1] * G % mod;
	}
	if(chck()) cout << "YES\n";
	else cout << "NO\n";
	cout << -1 << '\n';
	if(n <= 10) {
		int ans = 0;
		L(sub, 0, (1 << (n - 1)) - 1) {
			vi np(n + 1);
			L(i, 1, n) 
				np[i] = a[i];
			L(i, 2, n) {
				if(sub >> (i - 2) & 1) {
					swap(np[s[i]], np[fa[s[i]]]);
				}	
			}
			int win = 0;
			L(i, 1, n) {
				if(p[i] != np[i]) {
					win = np[i] < p[i];
					break;
				}
			}
			ans += win;
		}
		cout << ans << '\n';
	} else {
		cout << -1 << '\n';
	}
	
	return 0;
}