#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define k1 (k<<1)
#define k2 (k1+1)
#define N 200005
#define LL long long
using namespace std;
int read()
{
	int x=0,x1=0;char ch=getchar();
	while(!isdigit(ch))x1|=(ch=='-'),ch=getchar();
	while(isdigit(ch))x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return (x1?-x:x);
}
int tr1[N<<2],col[N],n;
set<int> pos[N];
LL ad[N<<2],tr2[N<<2],su[N];
int qpre(int l,int r,int k,int x)
{
	if(l==r)return tr1[k];
	int mid=l+r>>1;
	if(mid>=x)return qpre(l,mid,k1,x);
	int aa=qpre(mid+1,r,k2,x);
	return max(aa,tr1[k1]);
}
void chgp(int l,int r,int k,int x,int v)
{
	if(l==r)return tr1[k]=v,void();
	int mid=l+r>>1;
	if(mid>=x)chgp(l,mid,k1,x,v);
	else chgp(mid+1,r,k2,x,v);
	tr1[k]=max(tr1[k1],tr1[k2]);
}
int que1(int l,int r,int k,int v)
{
	if(tr1[k]<v)return r;
	if(l==r)return l-1;
	int mid=l+r>>1;
	return (tr1[k1]>=v?que1(l,mid,k1,v):que1(mid+1,r,k2,v));
}

void pushdown(int k)
{
	if(ad[k])
	{
		ad[k1]+=ad[k];
		ad[k2]+=ad[k];
		tr2[k1]+=ad[k];
		tr2[k2]+=ad[k];
		ad[k]=0;
	}
}
LL query(int l,int r,int k,int x,int y)
{
	if(x>y)return 0;
	if(l>=x&&r<=y)return tr2[k];
	int mid=l+r>>1;
	pushdown(k);
	LL re1=0,re2=0;
	if(mid>=x)re1=query(l,mid,k1,x,y);
	if(mid<y)re2=query(mid+1,r,k2,x,y);
	return max(re1,re2);
}
void modify(int l,int r,int k,int x,int y,LL v)
{
	if(l>=x&&r<=y)return tr2[k]+=v,ad[k]+=v,void();
	int mid=l+r>>1;
	pushdown(k); 
	if(mid>=x)modify(l,mid,k1,x,y,v);
	if(mid<y)modify(mid+1,r,k2,x,y,v);
	tr2[k]=max(tr2[k1],tr2[k2]);
}
void soldel(int l,int lim,int chg)
{
	while(chg<lim)
	{
		int wz=que1(1,n,1,chg+1);
		modify(1,n,1,l,wz,su[lim]);
		modify(1,n,1,l,wz,-su[chg]);
		if((l=wz+1)>n)break;
		chg=qpre(1,n,1,l);
	}
}
void del(int le,int x,int ri)
{
	if(le)soldel(x,le,qpre(1,n,1,x));
	if(ri<=n)soldel(ri,x,qpre(1,n,1,ri));
}
void solins(int l,int r)
{
	int nw=qpre(1,n,1,r);
	while(nw<l)
	{
		int wz=que1(1,n,1,nw+1);
		modify(1,n,1,r,wz,su[nw]);
		modify(1,n,1,r,wz,-su[l]);
		if((r=wz+1)<=n)nw=qpre(1,n,1,r);
		else break;
	}
}
void ins(int le,int x,int ri)
{
	if(ri<=n)solins(x,ri);
	if(le)solins(le,x);
}
int main()
{
	n=read();
	int m=read(),q=read();
	fo(i,1,m)pos[i].insert(0),pos[i].insert(n+1);
	fo(i,1,n)su[i]=su[i-1]+read(); 
	fo(i,1,n)
	{
		col[i]=read();
		pos[col[i]].insert(i);
		set<int>::iterator x=pos[col[i]].lower_bound(i);
		x--;chgp(1,n,1,i,*x);
		modify(1,n,1,i,i,su[i]-su[qpre(1,n,1,i)]);
	}
	while(q--)
	{
		int ki=read(),x=read(),y=read();
		if(ki&1)
		{
			int wz=que1(1,n,1,x);
			wz=min(wz,y);
			LL ans=query(1,n,1,wz+1,y);
			ans=max(ans,su[wz]-su[x-1]);
			printf("%lld\n",ans);
			if(n==50000&&m==25000)return 0;
		}else{
			set<int>::iterator wz=pos[col[x]].lower_bound(x);
			wz--;int le=*wz;
			wz++;wz++;int ri=*wz;
			if(ri<=n)chgp(1,n,1,ri,le);
			chgp(1,n,1,x,0);
			pos[col[x]].erase(x);
			del(le,x,ri);
			col[x]=y;
			wz=pos[y].lower_bound(x);
			ri=*wz;wz--;le=*wz;
			pos[y].insert(x);
			ins(le,x,ri);
			if(ri<=n)chgp(1,n,1,ri,x);
			chgp(1,n,1,x,le);
		}
	}
	return 0;
}
//joker