#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pli=pair<ll,int>;using LL=__int128;
const int N=2e5+5,M=N*4+5,K=2e4+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,q,c[N];ll Sum[N];
set<int> f[N];
namespace Tree{
	#define ls v<<1
	#define rs v<<1|1
	int Mx[M];ll f[M],g[M];
	ll Find(int x,int l,int r,int v){
		if(l==r) return Sum[l]-Sum[max(x,Mx[v])];int m=l+r>>1;
		return x<=Mx[ls]?max(Find(x,l,m,ls),g[v]):max(Sum[m]-Sum[x],Find(x,m+1,r,rs));
	}
	void Up(int v,int m,int r){
		Mx[v]=max(Mx[ls],Mx[rs]);
		f[v]=max(f[ls],g[v]=Find(Mx[ls],m+1,r,rs));
	}
	void Ins(int x,int y,int l=1,int r=n,int v=1){
		if(l==r) {Mx[v]=y;f[v]=Sum[v]-Sum[y];return;}
		int m=l+r>>1;x<=m?Ins(x,y,l,m,ls):Ins(x,y,m+1,r,rs);Up(v,m,r);
	}
	ll qry(int x,int y,int &z,int l=1,int r=n,int v=1){
		if(x<=l&&r<=y) {ll p=Find(z,l,r,v);z=max(z,Mx[v]);return p;}
		int m=l+r>>1;return max(x<=m?qry(x,y,z,l,m,ls):0,y>m?qry(x,y,z,m+1,r,rs):0);
	}
	#undef ls
	#undef rs
}
int main(){
	int i,j;scanf("%d%d%d",&n,&m,&q);
	for(i=1;i<=n;i++) scanf("%lld",&Sum[i]),Sum[i]+=Sum[i-1];
	for(i=1;i<=m;i++) f[i].insert(0);
	for(i=1;i<=n;i++) scanf("%d",&c[i]),Tree::Ins(i,*f[c[i]].rbegin()),f[c[i]].insert(i);
	while(q--){
		int op,x,y;scanf("%d%d%d",&op,&x,&y);
		if(op==1) x--,printf("%lld\n",Tree::qry(x+1,y,x));
		else {
			f[c[x]].erase(x);
			auto p=f[c[x]].LB(x);
			if(p!=f[c[x]].end()){
				auto q=p;q--;Tree::Ins(*p,*q);
			}
			c[x]=y;
			p=f[c[x]].LB(x);
			auto q=p;q--;Tree::Ins(x,*q);
			if(p!=f[c[x]].end()) Tree::Ins(*p,x);
			f[c[x]].insert(x);
		}
	}
}