#include "circuit.h"
#include<bits/stdc++.h>
using namespace std;
long long l[800100], r[800100], v[800100], cont[800100], lz[800100], mod = 1000002022, po[200100], dep[200100], st[200100], nn;
void pd(int n) {
if(lz[n]){
v[n]=cont[n]-v[n];
lz[n]=0;
if(l[n]!=r[n]) lz[n*2]^=1,lz[n*2+1]^=1;
}
}
void build(int i, int L, int R) {
l[i] = L;
r[i] = R;
if(L==R) {
cont[i] = po[nn-dep[L+nn]];
v[i] = st[L]*cont[i];
} else {
build(i*2,L,L+R>>1);
build(i*2+1,L+R+2>>1, R);
cont[i] = cont[i*2]+cont[i*2+1];
v[i] = v[i*2]+v[i*2+1];
}
}
void update(int i, int tl, int tr) {
if(tl<=l[i]&&r[i]<=tr)
lz[i]^=1, tr=-1;
pd(i);
if(l[i]>tr||tl>r[i])
return;
update(i*2,tl,tr);
update(i*2+1,tl,tr);
v[i] = v[i*2]+v[i*2+1];
}
void init(int N, int M, vector<int> P, vector<int> A) {
nn=N;
for(int i = 0; i < M; i++)
st[i] = A[i];
for(int i = 1; i < N+M; i++)
dep[i] = 1+dep[P[i]];
po[0] = 1;
for(int i = 1; i <= N; i++)
po[i] = po[i-1]*2%mod;
build(1,0,M-1);
}
int count_ways(int L, int R) {
update(1,L-nn,R-nn);
return v[1]%mod;
}
