#include "circuit.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
using namespace std;
const ll mod=1e9+2022;
const ll N=2e5+9;
ll n, m, a[N], pw[N], cnt[N], ans=0;
vector<ll> v[N], pre[N], suf[N];
void dfs(ll x){
if (x>=n){
pw[x]=1;
return;
}
pw[x]=v[x].size();
for (ll i: v[x]){
dfs(i);
pw[x]=pw[x]*pw[i]%mod;
}
}
void dfs2(ll x, ll now=1){
if (x>=n){
cnt[x]=now;
return;
}
ll sz=v[x].size();
pre[x].resize(sz);
pre[x][0]=pw[v[x][0]];
for (int i=1; i<sz; i++) pre[x][i]=pre[x][i-1]*pw[v[x][i]]%mod;
suf[x].resize(sz);
suf[x][sz-1]=pw[v[x][sz-1]];
for (int i=sz-2; i>=0; i--) suf[x][i]=suf[x][i+1]*pw[v[x][i]]%mod;
for (int i=0; i<sz; i++){
ll tmp=now;
if (i) tmp=tmp*pre[x][i-1]%mod;
if (i<sz-1) tmp=tmp*suf[x][i+1]%mod;
dfs2(v[x][i], tmp);
}
}
void init(int N, int M, vector<int> P, vector<int> A){
n=N, m=M;
for (int i=1; i<n+m; i++) v[P[i]].push_back(i);
for (int i=0; i<m; i++) a[i+n]=A[i];
dfs(0);
dfs2(0);
for (int i=n; i<n+m; i++){
if (a[i]) ans=(ans+cnt[i])%mod;
}
}
int count_ways(int L, int R){
for (int i=L; i<=R; i++){
a[i]^=1;
if (a[i]) ans=(ans+cnt[i])%mod;
else ans=(ans-cnt[i]+mod)%mod;
}
return ans;
}
