#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;
const int mod = 998244353;
int n, rt;
vi son[N];

int s[N], fa[N], top;
int a[N], p[N];

int stop;

int mx_sub[N], mn_sub[N]; 
void dfs(int x) {
	s[++stop] = x;
	mx_sub[x] = a[x], mn_sub[x] = a[x];
	for(auto&v : son[x]) {
		fa[v] = x;
		dfs(v);
		mx_sub[x] = max(mx_sub[x], mx_sub[v]);
		mn_sub[x] = min(mn_sub[x], mn_sub[v]);
	}
}

void dfs1(int 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 mp[N]; 
vector < pair < int, int > > vp[N]; 

int vis[N];
pair < int, int > stk[N];

vector < pair < int, int > > vec;
int fnd = 0, ans;

int aimp, rec, pw[N];
void Get(int rt, int lim) {
	if(lim <= s[rt]) {
		if(mx_sub[rt] < aimp) {
			(ans += pw[rec - top]) %= mod;
			return;
		}
		if(mn_sub[rt] > aimp) {
			return ;
		}
	}
//	cout << " rt = " << rt << ' ' << rec << endl;
	auto K = lower_bound(vp[rt].begin(), vp[rt].end(), make_pair(lim, -114514));
	if(K == vp[rt].begin()) {
		if(a[rt] == aimp) {
			fnd = 1, vec.clear(); 
			L(i, 1, top) 
				vec.emplace_back(stk[i]);
		} else if(a[rt] < aimp) {
			(ans += pw[rec - top]) %= mod;
		}
		return ;
	}
	--K;
	int v = K -> second;
	int e = K -> first;
	L(c, 0, 1) {
		if(vis[e] != -1 && vis[e] != c) 
			continue;
		int pb = 0;
		if(vis[e] == -1) 
			pb = 1, stk[++top] = {e, c};
		if(c) Get(v, e);
		else Get(rt, e);
		if(pb) --top;
	}
}
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;
	}
	L(i, 2, n) {
		int u = s[i];
		vp[fa[u]].emplace_back(i, u);
		vp[u].emplace_back(i, fa[u]);
	}
	if(chck()) cout << "YES\n";
	else cout << "NO\n";
	cout << "no comment\n";
	L(i, 1, n) {
		mp[p[i]] = i;
	}
	L(i, 2, n) {
		vis[i] = -1;
	}
	pw[0] = 1;
	L(i, 1, n) 
		pw[i] = (ll) pw[i - 1] * 2 % mod;
	auto st = clock();
	rec = n - 1;
	ans = 0;
	L(rt, 1, n) {
		aimp = p[rt], vec.clear(), fnd = 0;
		top = 0;
		Get(rt, n + 1);
		if(!fnd) 
			break;
		for(auto&r : vec) 
			vis[r.first] = r.second; 
		rec -= sz(vec);
		if(((double) clock() - st) / CLOCKS_PER_SEC > 4.8) {
			cout << "no comment\n";
			return 0;
		}
	}
	cout << ans << '\n';
	return 0;
}