#include "circuit.h"

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define fir first
#define sec second
#define mod 1000002022
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
typedef pair<int,int> pii;
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
inline int add(int x,int y) {return x+y>=mod?x+y-mod:x+y;}
inline int add(int x,int y,int z) {return add(add(x,y),z);}
inline int sub(int x,int y) {return x-y<0?x-y+mod:x-y;}
inline int mul(int x,int y) {return 1LL*x*y%mod;}
inline int mul(int x,int y,int z) {return mul(mul(x,y),z);}
#define inc(x,y) x=add(x,y)
#define dec(x,y) x=sub(x,y)
#define N 200005
vector<int> G[N];
int cnt[N],siz[N],f[N];
void dfs1(int u)
{
	cnt[u]=1,siz[u]=1;
	for(int v:G[u]) dfs1(v),cnt[u]=mul(cnt[u],cnt[v]),siz[u]+=siz[v];
	if(!G[u].empty()) cnt[u]=mul(cnt[u],(int)G[u].size());
}
void dfs2(int u,int fv)
{
	f[u]=fv;
	if(G[u].empty()) return ;
	int s=(int)G[u].size();
	vector<int> pre(s),suf(s);
	pre[0]=cnt[G[u][0]]; for(int i=1;i<s;i++) pre[i]=mul(pre[i-1],cnt[G[u][i]]);
	suf[s-1]=cnt[G[u][s-1]]; for(int i=s-2;i>=0;i--) suf[i]=mul(suf[i+1],cnt[G[u][i]]);
//	print(pre),print(suf);
	for(int i=0;i<s;i++)
	{
		int cv=mul(i==0?1:pre[i-1],i==s-1?1:suf[i+1],fv);
		dfs2(G[u][i],cv);
	}
}
int cur[N],w[N],n,m;
void init(int _n, int _m, std::vector<int> fa, std::vector<int> A) {
	n=_n,m=_m;
	for(int i=1;i<n+m;i++) G[fa[i]].pb(i);
	dfs1(0);
//	for(int i=0;i<n+m;i++) printf("%d%c",cnt[i]," \n"[i==n+m-1]);
	dfs2(0,1);
//	for(int i=0;i<n+m;i++) printf("%d%c",f[i]," \n"[i==n+m-1]);
	for(int i=0;i<m;i++) cur[i]=A[i],w[i]=f[i+n];
}
int count_ways(int L, int R) {
	int l=L-n,r=R-n;
	for(int i=l;i<=r;i++) cur[i]^=1;
	int ans=0;
	for(int i=0;i<m;i++) ans=add(ans,mul(cur[i],w[i]));
	return ans;
}

#undef N
#ifdef wasa855
#include "circuit.h"

#include <cassert>
#include <cstdio>

#include <vector>

int main() {
  int N, M, Q;
  assert(3 == scanf("%d %d %d", &N, &M, &Q));
  std::vector<int> P(N + M), A(M);
  for (int i = 0; i < N + M; ++i) {
    assert(1 == scanf("%d", &P[i]));
  }
  for (int j = 0; j < M; ++j) {
    assert(1 == scanf("%d", &A[j]));
  }
  init(N, M, P, A);

  for (int i = 0; i < Q; ++i) {
    int L, R;
    assert(2 == scanf("%d %d", &L, &R));
    printf("%d\n", count_ways(L, R));
  }
  return 0;
}
#endif