#include "circuit.h"
#include <bits/stdc++.h>2
#define ll long long
using namespace std;
#include <vector>
const int N = 2e5 + 5, mod = 1000002022;
int sub[N], k[N], n, m, a[N], t[4 * N][2];
bool lz[4 * N];
vector<int> V[N];
void dfs(int u) {
sub[u] = 1;
if(V[u].size()) sub[u] = (ll)sub[u] * V[u].size() % mod;
for(int i = 0; i < V[u].size(); i++) {
dfs(V[u][i]);
sub[u] = (ll)sub[u] * sub[V[u][i]] % mod;
}
}
void dfs2(int u, int cur) {
vector<int> p(V[u].size()), s(V[u].size());
k[u] = cur;
for(int i = 0; i < V[u].size(); i++) {
p[i] = sub[V[u][i]];
if(i) p[i] = (ll)p[i] * p[i - 1] % mod;
}
for(int i = (int)V[u].size() - 1; i >= 0; i--) {
s[i] = sub[V[u][i]];
if(i + 1 != V[u].size()) s[i] = (ll)s[i + 1] * s[i] % mod;
}
for(int i = 0; i < V[u].size(); i++) {
int x = 1;
if(i) x = (ll)x * p[i - 1] % mod;
if(i + 1 != V[u].size()) x = (ll)x * s[i + 1] % mod;
dfs2(V[u][i], (ll)cur * x % mod);
}
}
void build(int u,int l,int r) {
if(l == r) {
t[u][0] = k[l + n];
t[u][1] = k[l + n] * a[l + n];
return;
}
int mid = (l + r) / 2;
build(2 * u, l, mid); build(2 * u + 1, mid + 1, r);
for(int i = 0; i <= 1; i++) t[u][i] = (t[2 * u][i] + t[2 * u+ 1][i]) % mod;
}
void push(int u,int l,int r) {
if(!lz[u]) return;
lz[u] = 0;
t[u][1] = (t[u][0] - t[u][1] + mod) % mod;
if(l != r) lz[2 * u] = 1 - lz[2 * u], lz[2 * u + 1] = 1 - lz[2 * u + 1];
}
void upd(int u,int st,int en,int l,int r) {
push(u, l, r);
if(l > en || r < st) return;
if(st <= l && r <= en) {
lz[u] = 1;
push(u, l, r);
return;
}
int mid = (l + r) / 2;
upd(2 * u, st, en, l, mid); upd(2 * u + 1, st, en, mid + 1, r);
for(int i = 0; i <= 1; i++) t[u][i] = (t[2 * u][i] + t[2 * u+ 1][i]) % mod;
}
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
n = N, m = M;
for(int i = 1; i < N + M; i++) {
V[P[i]].push_back(i);
}
for(int i = N; i < N + M; i++) a[i] = A[i - N];
dfs(0);
dfs2(0, 1);
build(1, 0, M - 1);
}
int count_ways(int L, int R) {
L -= n; R -= n;
upd(1, L, R, 0, m - 1);
return t[1][1];
}
