#include "circuit.h"

#include <bits/stdc++.h>

using namespace std;

constexpr int mod = 1e9 + 2022;

constexpr int maxn = 2e5 + 5;

int n, m;

vector<int> g[maxn];

int ans[maxn], not_ans[maxn];

void calc_ans(int v) {
    if (v >= n) {
        return;
    }
    vector<int> dp(g[v].size() + 1);
    dp[0] = 1;
    for (auto u : g[v]) {
        calc_ans(u);
        for (int cnt = (int)g[v].size(); cnt >= 0; --cnt) {
            dp[cnt] = dp[cnt] * 1LL * not_ans[u] % mod;
            if (cnt > 0) {
                dp[cnt] += dp[cnt - 1] * 1LL * ans[u] % mod;
                if (dp[cnt] >= mod) {
                    dp[cnt] -= mod;
                }
            }
        }
    }
    ans[v] = not_ans[v] = 0;
    for (int cnt = 0; cnt <= (int)g[v].size(); ++cnt) {
        ans[v] += dp[cnt] * 1LL * cnt % mod;
        if (ans[v] >= mod) {
            ans[v] -= mod;
        }
        not_ans[v] += dp[cnt] * 1LL * ((int)g[v].size() - cnt) % mod;
        if (not_ans[v] >= mod) {
            not_ans[v] -= mod;
        }
    }
}

void init(int _n, int _m, vector<int> p, vector<int> a) {
    n = _n;
    m = _m;
    for (int i = 1; i < n + m; ++i) {
        g[p[i]].push_back(i);
    }
    for (int i = 0; i < m; ++i) {
        ans[n + i] = a[i];
        not_ans[n + i] = 1 - a[i];
    }
}

int count_ways(int l, int r) {
    r++;
    for (int i = l; i < r; ++i) {
        swap(ans[i], not_ans[i]);
    }
    calc_ans(0);
    return ans[0];
}