#include <bits/stdc++.h>
#define ent '\n'
#define f first
#define s second
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 12;
const int mod = 1e9 + 2022;
pair<ll, ll> t[maxn*4];
vector<int> g[maxn];
ll dp[maxn];
ll mul[maxn];
int a[maxn];
int p[maxn];
int n, m;
void calc(int v, int p){
dp[v] = max(1, (int)g[v].size());
for(int to:g[v]){
calc(to, v);
dp[v] = dp[v] * dp[to] % mod;
}
}
void dfs(int v, int p){
if(!mul[v]) mul[v] = 1;
vector<int> suff;
for(int i=0;i<g[v].size();i++){
suff.push_back(dp[g[v][i]]);
}
suff.push_back(1);
for(int i=(int)suff.size()-2;i>=0;i--){
suff[i] = suff[i] * suff[i+1] % mod;
}
ll pref = 1;
for(int i=0;i<g[v].size();i++){
int to = g[v][i];
mul[to] = pref * suff[i+1] % mod * mul[v] % mod;
dfs(to, v);
pref = pref * dp[to] % mod;
}
}
void build(int v, int tl, int tr){
p[v] = 0;
if(tl == tr){
if(a[tl]){
t[v] = {0, mul[tl+m-1]};
}
else{
t[v] = {mul[tl+m-1], 0};
}
}
else{
int mid = tl + tr >> 1;
build(v*2, tl, mid);
build(v*2+1, mid+1, tr);
t[v].f = (t[v*2].f + t[v*2+1].f) % mod;
t[v].s = (t[v*2].s + t[v*2+1].s) % mod;
}
}
void push(int v, int tl, int tr){
if(tl == tr || !p[v]){
return;
}
p[v*2] ^= 1;
p[v*2+1] ^= 1;
swap(t[v*2].f, t[v*2].s);
swap(t[v*2+1].f, t[v*2+1].s);
p[v] = 0;
}
void upd(int v, int tl, int tr, int l, int r){
push(v, tl, tr);
if(tl > r || l > tr){
return;
}
if(tl >= l && tr <= r){
swap(t[v].f, t[v].s);
p[v] = 1;
return;
}
int mid = tl + tr >> 1;
upd(v*2, tl, mid, l, r);
upd(v*2+1, mid+1, tr, l, r);
t[v].f = (t[v*2].f + t[v*2+1].f) % mod;
t[v].s = (t[v*2].s + t[v*2+1].s) % mod;
}
void init(int N, int M, std::vector<int> p, std::vector<int> A){
m = N, n = M;
for(int i=1;i<n+m;i++){
g[p[i]].push_back(i);
}
for(int i=1;i<=n;i++){
a[i] = A[i-1];
}
calc(0, -1);
dfs(0, -1);
build(1, 1, n);
}
int count_ways(int L, int R){
L -= m - 1, R -= m - 1;
upd(1, 1, n, L, R);
return t[1].s;
}
