#pragma target("avx512f,sse2,sse3,sse4,sse4.2")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=500005,M=10000005,inf=1e18;
int n,m,q,a[N],col[N],ql[N],qr[N];
ll sum[N],maxx[N*4];
#define lc k<<1
#define rc k<<1|1
#define ls lc,l,mid
#define rs rc,mid+1,r
struct T{int x,y;};vector<T>v[N*4];
void change(int k,int l,int r,int x,int y,int v1,int v2){
	if(x<=l&&r<=y){
		v[k].push_back(T{v1+1,v2});
		return ;
	}
	int mid=l+r>>1;
	if(x<=mid) change(ls,x,y,v1,v2);
	if(mid<y) change(rs,x,y,v1,v2);
}
int tim[N],tot;set<int>s[N];
void ins1(int x,int y,int z){
	s[x].insert(y);
	auto i=s[x].find(y);auto j=i,p=i;
	j++;if(i!=s[x].begin())p--;
	if(i!=s[x].begin())if(j!=s[x].end()){change(1,1,q,tim[*j],z,(*p),(*j));}
	if(j!=s[x].end()) tim[*j]=z;
	if(i!=s[x].begin()) tim[*i]=z;
}
void del1(int x,int y,int z){
	auto i=s[x].find(y);auto j=i,p=i;
	j++;if(i!=s[x].begin())p--;
	if(j!=s[x].end()){change(1,1,q,tim[*j],z,(*i),(*j));}
	if(i!=s[x].begin()){change(1,1,q,tim[*i],z,(*p),(*i));}
	if(i!=s[x].begin())if(j!=s[x].end()) tim[*j]=z;
	s[x].erase(y);
}
struct node{int tag,pre;ll ans2;}tree[N*4];
void build1(int k,int l,int r){
	tree[k].pre=1;
	if(l==r){tree[k].ans2=maxx[k]=sum[l];return ;}
	int mid=l+r>>1;
	build1(ls),build1(rs);
	maxx[k]=max(maxx[lc],maxx[rc]);
	tree[k].ans2=max(tree[lc].ans2,tree[rc].ans2);
}
ll ask1(int k,int l,int r,int x,int y){
	if(x<=l&&r<=y) return maxx[k];
	int mid=l+r>>1;
	if(x<=mid&&mid<y) return max(ask1(ls,x,y),ask1(rs,x,y));
	if(x<=mid) return ask1(ls,x,y);
	return ask1(rs,x,y);
}
int top;struct A{int p;node w;}stk[M];
void pushdown(int k){
	stk[++top]=A{lc,tree[lc]};
	stk[++top]=A{rc,tree[rc]};
	if(tree[k].tag){
		tree[lc].pre=tree[rc].pre=tree[k].tag;
		tree[lc].tag=tree[rc].tag=tree[k].tag;
		tree[lc].ans2=maxx[lc]-sum[tree[k].tag-1];
		tree[rc].ans2=maxx[rc]-sum[tree[k].tag-1];
		tree[k].tag=0;
	}
}
void pushup(int k){
	tree[k].pre=max(tree[lc].pre,tree[rc].pre);
	tree[k].ans2=max(tree[lc].ans2,tree[rc].ans2);}
int ask(int k,int l,int r,int d){
	stk[++top]=A{k,tree[k]};
	if(l==r) return l+(tree[k].pre<=d);
	int mid=l+r>>1;
	pushdown(k);
	if(tree[lc].pre<=d) return ask(rs,d);
	return ask(ls,d);
}
void change2(int k,int l,int r,int x,int y,int d){
	stk[++top]=A{k,tree[k]};
	if(x<=l&&r<=y){
		tree[k].tag=tree[k].pre=d;
		tree[k].ans2=maxx[k]-sum[d-1];
		return ;
	}
	int mid=l+r>>1;
	pushdown(k);
	if(x<=mid) change2(ls,x,y,d);
	if(mid<y) change2(rs,x,y,d);
	pushup(k);
}
ll ask2(int k,int l,int r,int x,int y){
	stk[++top]=A{k,tree[k]};
	if(x<=l&&r<=y) return tree[k].ans2;
	int mid=l+r>>1;
	pushdown(k);
	if(x<=mid&&mid<y) return max(ask2(ls,x,y),ask2(rs,x,y));
	if(x<=mid) return ask2(ls,x,y);
	return ask2(rs,x,y);
}

void work(int k,int l,int r){
	int las=top,p;
//	printf("%d %d %d\n",k,l,r);
	for(T e:v[k]){
//		printf(":::%d %d\n",e.x,e.y);
		p=ask(1,1,n,e.x)-1;
		if(e.y<=p) change2(1,1,n,e.y,p,e.x); 
	}
	if(l==r){
		if(ql[l]!=0){
			int pos;ll ans=0;
			pos=ask(1,1,n,ql[l])-1;
			if(ql[l]<=pos) ans=max(ans,ask1(1,1,n,ql[l],min(qr[l],pos))-sum[ql[l]-1]);
			if(pos+1<=qr[l]) ans=max(ans,ask2(1,1,n,max(ql[l],pos+1),qr[l]));
			printf("%lld\n",ans);
		}
	}
	else{
		int mid=l+r>>1;
		work(ls);
		work(rs);
	}
	while(top>las){
		tree[stk[top].p]=stk[top].w;
		top--;
	}
}
int main(){
//	freopen("data.in","r",stdin);
//	freopen("data.out","w",stdout);
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
	for(int i=1;i<=n;i++) scanf("%d",&col[i]);
	for(int i=1;i<=n;i++) ins1(col[i],i,1);
	for(int i=1,op,x,y;i<=q;i++){
		scanf("%d%d%d",&op,&x,&y);
		if(op==2){
			del1(col[x],x,i);
			col[x]=y;
			ins1(col[x],x,i);
		}
		else ql[i]=x,qr[i]=y;
	}
	for(int i=1;i<=n;i++) del1(col[i],i,q);
	build1(1,1,n);
	work(1,1,q);
	return 0;
}

/*
3 3 3
10 1 1 
1 3 1 
1 2 2
2 2 1
1 1 3


*/