#include<bits/stdc++.h>
#define ll long long
#define N 400000
using namespace std;
int n,m,q,c[N],x,y,tol;
ll a[N],last[N],f[N*4],g[N*4];
set<int>b[N];
ll solve(int k,int l,int r,ll pre){
	if(l==r)return a[l]-max(pre,g[k]);
	int mid=(l+r)>>1;
	if(g[k*2]>=pre)
	return max(f[k],solve(k*2,l,mid,pre));
	else return solve(k*2+1,mid+1,r,pre);
}
void join(int k,int l,int r,int x,int y){ 
	if(l==r){
		g[k]=a[y];f[k]=0;return;
	}int mid=(l+r)>>1;
	if(x<=mid)join(k*2,l,mid,x,y);
	else join(k*2+1,mid+1,r,x,y);
	g[k]=max(g[k*2],g[k*2+1]);f[k]=solve(k*2+1,mid+1,r,g[k*2]);
}
ll get(int k,int l,int r,int x,int y,ll z){
	if(l>=x&&r<=y)return solve(k,l,r,z);
	int mid=(l+r)>>1;ll sum=0;
	if(x<=mid)sum=max(sum,get(k*2,l,mid,x,y,z));
	if(y>mid)sum=max(sum,get(k*2+1,mid+1,r,x,y,max(z,g[k*2])));
	return sum;
}
int main(){
//	freopen("a2.in","r",stdin);
//	freopen("a.out","w",stdout);
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=m;i++)b[i].emplace(0);
	for(int i=1;i<=n;i++)
	{scanf("%lld",&a[i]);a[i]+=a[i-1];}
	for(int i=1;i<=n;i++){
		scanf("%d",&c[i]);
		auto it=b[c[i]].emplace(i).first;
		join(1,1,n,i,*prev(it));
	}
	for(;q;q--){
		scanf("%d",&tol);
		if(tol==2){
			scanf("%d%d",&x,&y);
			auto it=b[c[x]].find(x);
			if(next(it)!=b[c[x]].end())
			join(1,1,n,*next(it),*prev(it));
			b[c[x]].erase(x);c[x]=y;
			it=b[c[x]].emplace(x).first;
			if(next(it)!=b[c[x]].end())
			join(1,1,n,*next(it),*it);
			join(1,1,n,*it,*prev(it));
		}else{
			scanf("%d%d",&x,&y);
			printf("%lld\n",get(1,1,n,x,y,a[x-1]));
		}
	}
}