#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
#define rpe(i,x) for(int i=_he[x];i;i=_ne[i])
using namespace std;
typedef long long LL;
typedef pair<int,LL>pil;
const int N=2e5+10;

int pre[N],c[N],n,m,Q;
LL s[N];
namespace T{
	int pmx[N<<2];
	LL dat[N<<2],F[N<<2];
	LL solve(int p,int l,int r,int x)
	{
		if(l==r)return s[l]-s[max(x,pre[l])];
		int mid=(l+r)>>1;
		if(x>=pmx[p<<1])return max(s[mid]-s[x],solve(p<<1|1,mid+1,r,x));
		return max(solve(p<<1,l,mid,x),F[p<<1|1]);
	}
	void pup(int p,int mid,int r)
	{
		pmx[p]=max(pmx[p<<1],pmx[p<<1|1]);
		F[p<<1|1]=solve(p<<1|1,mid+1,r,pmx[p<<1]);
		dat[p]=max(dat[p<<1],F[p<<1|1]);
	}
	void build(int p,int l,int r)
	{
		if(l==r)return dat[p]=s[l]-s[pmx[p]=pre[l]],void();
		int mid=(l+r)>>1;
		build(p<<1,l,mid),build(p<<1|1,mid+1,r);
		pup(p,mid,r);
		//printf("%d %d   %lld qwq\n",l,r,dat[p<<1]);
	}
	void mdf(int p,int l,int r,int pos,int v)
	{
		if(l==r)return pre[p]=v,void();
		int mid=(l+r)>>1;
		pos<=mid?mdf(p<<1,l,mid,pos,v):mdf(p<<1|1,mid+1,r,pos,v);
		pup(p,mid,r);
	}
	pil ask(int p,int l,int r,int tl,int tr,int x)
	{
		if(l>=tl&&r<=tr)return {max(x,pmx[p]),solve(p,l,r,x)};
		int mid=(l+r)>>1;
		if(tl<=mid&&tr>mid)
		{
			pil L=ask(p<<1,l,mid,tl,tr,x),R=ask(p<<1|1,mid+1,r,tl,tr,max(x,L.first));
			return {max(L.first,R.first),max(L.second,R.second)};
		}
		return tl<=mid?ask(p<<1,l,mid,tl,tr,x):ask(p<<1|1,mid+1,r,tl,tr,x);
	}
}

set<int>S[N];
int main()
{
	scanf("%d%d%d",&n,&m,&Q);
	rep(i,1,n)scanf("%lld",&s[i]),s[i]+=s[i-1];
	rep(i,1,n)
	{
		scanf("%d",&c[i]);
		if(!S[c[i]].empty())pre[i]=*prev(S[c[i]].end());
		S[c[i]].insert(i);
	}
	T::build(1,1,n);
	//printf("%lld qwq\n",T::ask(1,1,n,1,3,0).second);
	while(Q--)
	{
		int opt,x,y;scanf("%d%d%d",&opt,&x,&y);
		if(opt==1)printf("%lld\n",T::ask(1,1,n,x,y,0).second);
		else
		{
			if(c[x]==y)continue;
			S[c[x]].erase(x);
			auto it=S[c[x]].lower_bound(x);
			if(it!=S[c[x]].end())
			{
				if(it==S[c[x]].begin())pre[*it]=0;
				else pre[*it]=*prev(it);
				T::mdf(1,1,n,*it,pre[*it]);
			}
			
			it=S[y].lower_bound(x);
			if(it!=S[y].end())
			{
				pre[*it]=x;
				T::mdf(1,1,n,*it,x);
			}
			if(it==S[y].begin())pre[x]=0;
			else pre[x]=*prev(it);
			T::mdf(1,1,n,x,pre[x]);
		}
	}
	return 0;
}