#include "circuit.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;

namespace {

const int N = 2e5 + 7;
const int md = 1e9 + 2022;

int add(int a, int b) {
	return a + b < md ? a + b : a + b - md;
}

int mul(int a, int b) {
	return a * 1ll * b % md;
}

int pw(int a, int n) {
	int ret = 1;
	while (n > 0) {
		if (n & 1) {
			ret = mul(ret, a);
		}
		a = mul(a, a);
		n >>= 1;
	}
	return ret;
}

int n, m;
int p[N], a[N];
int h[N];
int dp[N];
int sz[N];
vector<int> g[N];
int kek[N];

void dfsdp(int v) {
	dp[v] = v >= n ? 1 : sz[v];
	for (int u : g[v]) {
		dfsdp(u);
		dp[v] = mul(dp[v], dp[u]);
	}
}

void dfskek(int v) {
	if (sz[v] == 0) {
		return;
	}
	{
		vector<int> pref(sz[v] + 1, 1), suf(sz[v] + 1, 1);
		for (int i = 0; i < sz[v]; ++i) {
			pref[i + 1] = mul(pref[i], dp[g[v][i]]);
			suf[i + 1] = mul(suf[i], dp[g[v][sz[v] - i - 1]]);
		}
		for (int i = 0; i < sz[v]; ++i) {
			int u = g[v][i];
			kek[u] = mul(pref[i], suf[sz[v] - i - 1]);
		}
	}
	for (int u : g[v]) {
		dfskek(u);
	}
}

}

void init(int grdn, int grdm, vector<int> grdp, vector<int> grda) {
	n = grdn;
	m = grdm;
	for (int i = 0; i < n + m; ++i) {
		p[i] = grdp[i];
	}
	for (int i = 0; i < m; ++i) {
		a[n + i] = grda[i];
	}
	h[0] = 0;
	for (int i = 1; i < n + m; ++i) {
		h[i] = h[p[i]] + 1;
		g[p[i]].push_back(i);
	}
	for (int i = 0; i < n + m; ++i) {
		sz[i] = g[i].size();
	}
	dfsdp(0);
	kek[0] = 1;
	dfskek(0);
}

int count_ways(int grdl, int grdr) {
	int l = grdl;
	int r = grdr;
	++r;
	for (int i = l; i < r; ++i) {
		a[i] ^= 1;
	}
	int ret = 0;
	for (int i = n; i < n + m; ++i) {
		if (a[i] == 1) {
			ret = add(ret, kek[i]);
		}
	}
	return ret;
}