#include "circuit.h"
#include<bits/stdc++.h>
using namespace std;
long long tm = 1, l[80100], r[80100], v[80100], cont[80100], lz[80100], mod = 1000002022, st[20100], nn, deg[20100], Cont[10010];
set<int> nansc;
vector<int> adj[20100];
void dfs(int n) {
if(n>=nn) {
Cont[n-nn]=1;
for(auto i: nansc)
Cont[n-nn]=Cont[n-nn]*deg[i]%mod;
return;
}
nansc.erase(n);
for(auto i: adj[n])
dfs(i);
nansc.insert(n);
}
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] = Cont[L];
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) {
for(int i = 0; i < N; i++)
nansc.insert(i);
nn=N;
for(int i = 0; i < M; i++)
st[i] = A[i];
for(int i = 1; i < N+M; i++)
adj[P[i]].push_back(i), deg[P[i]]++;
dfs(0);
build(1,0,M-1);
}
int count_ways(int L, int R) {
update(1,L-nn,R-nn);
return v[1]%mod;
}
