#include "circuit.h"
#include <cstring>
#include <vector>
#include <cassert>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
int n, m;
vector<int>child[200001];
bool state[200001];
ll encen[200001][2]; // encendido y apagado
const int MOD = 1000002022;
int past[2002][2002];
void generate(int node);
int parent[200002];
bool casito = true;
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
n = N;
m = M;
if( m != n+1 )casito = false;
for(int i = 0 ; i < n+m ; i ++){
if(P[i] != -1){
child[P[i]].pb(i);
if(P[i] != (i-1)/2)casito = false;
}
parent[i] = P[i];
}
int temp = m;
while(temp != 1){
if(temp % 2 == 1)casito = false;
temp /= 2;
}
//assert(casito);
for(int i = N ; i <= N+M ; i ++)state[i] = A[i-N];
memset(past, -1, sizeof past);
generate(0);
}
ll mem[2002][2002];
int currentIt = -1;
void newDp(){
currentIt++;
}
ll dp(int parent, int i, int k){
if(k < 0)return 0;
if(i == child[parent].size() and k > 0)return 0;
else if(i == child[parent].size()) return 1;
if(past[i][k] == currentIt)return mem[i][k];
past[i][k] = currentIt;
return mem[i][k] = ((dp(parent, i+1, k-1) * encen[child[parent][i]][0] % MOD) + ((dp(parent, i+1, k) * encen[child[parent][i]][1])%MOD))%MOD;
}
void generate(int node){
if(node >= n){
if(state[node]){
encen[node][0] = 1;
encen[node][1] = 0;
}else{
encen[node][0] = 0;
encen[node][1] = 1;
}
return ;
}
for(int i = 0 ; i < child[node].size() ; i ++){
generate(child[node][i]);
}
newDp();
ll enc = 0;
for(int i = 1 ; i <= child[node].size() ; i ++){
enc += dp(node, 0, i) * i;
enc %= MOD;
}
ll allWays = 1;
for(int i = 0 ; i < child[node].size() ; i ++){
allWays *= (encen[child[node][i]][0] + encen[child[node][i]][1]);
allWays %= MOD;
}
allWays *= child[node].size();
allWays %= MOD;
encen[node][0] = enc;
encen[node][1] = ((allWays - enc) + MOD) % MOD;
//cout << "for node " << node << " there are " << encen[node][0] << ", " << encen[node][1] << "\n";
}
void recargar(int node){
if(node >= n){
if(state[node]){
encen[node][0] = 1;
encen[node][1] = 0;
}else{
encen[node][0] = 0;
encen[node][1] = 1;
}
return ;
}
newDp();
ll enc = 0;
for(int i = 1 ; i <= child[node].size() ; i ++){
enc += dp(node, 0, i) * i;
enc %= MOD;
}
ll allWays = 1;
for(int i = 0 ; i < child[node].size() ; i ++){
allWays *= (encen[child[node][i]][0] + encen[child[node][i]][1]);
allWays %= MOD;
}
allWays *= child[node].size();
allWays %= MOD;
encen[node][0] = enc;
encen[node][1] = ((allWays - enc) + MOD) % MOD;
if(parent[node] != -1)recargar(parent[node]);
}
int count_ways(int L, int R) {
for(int i = L ; i <= R ; i ++){
state[i] = !state[i];
}
if( l == R and casito and (n > 1000 or m > 1000) )recargar(L);
else generate(0);
return encen[0][0];
}