#include<bits/stdc++.h>
using namespace std;
inline int qread()
{
	int a=0,f=1;char ch=getchar();
	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){a=(a*10)+(ch^48);ch=getchar();}
	return a*f;
}
int n,m,q,a[200010],col[200010],cz[200010][3],b[400010];
int cl,c[200010],st[450],ed[450],l,r,vis[200010];
int len[200010],cx,xk;
long long pre[200010],an[200010],ans,sum[450];
inline void solve()
{
	l=r=1;
	++vis[col[1]];
	ans=a[1];
	for(int i=1;i<=n;++i)
	{
		while(r<n&&!vis[col[r+1]])
		{
			++r;
			++vis[col[r]];
			ans+=a[r];
		}
		an[i]=ans;
		len[i]=r-l+1;
		sum[c[i]]=max(sum[c[i]],an[i]);
		--vis[col[l]];
		ans-=a[l];
		++l;
	}
	memset(vis,0,sizeof(vis));
	return ;
}
inline void Q(int h)
{
	l=cz[h][1],r=cz[h][2];
	ans=0;
	if(c[l]==c[r])
	{
		for(int i=l;i<=r;++i)
		{
			if(i+len[i]-1<=r)ans=max(ans,an[i]);
			else ans=max(ans,pre[r]-pre[i-1]);
		}
	}
	else
	{
		for(int i=l;i<=ed[c[l]];++i)
		{
			if(i+len[i]-1<=r)ans=max(ans,an[i]);
			else ans=max(ans,pre[r]-pre[i-1]);
		}
		for(int i=ed[c[l]]+1;i<st[c[r]];++i)
		{
			if(ed[c[i]]+len[ed[c[i]]]-1<=r)ans=max(ans,sum[c[i]]),i=ed[c[i]];
			else if(i+len[i]-1<=r)ans=max(ans,an[i]);
			else ans=max(ans,pre[r]-pre[i-1]);
		}
		for(int i=st[c[r]];i<=r;++i)
		{
			if(i+len[i]-1<=r)ans=max(ans,an[i]);
			else ans=max(ans,pre[r]-pre[i-1]);
		}
	}
	printf("%lld\n",ans);
	return ;
}
int main()
{
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	n=qread();
	cl=sqrt(n)+1;
	m=qread();
	q=qread();
	for(int i=1;i<=n;++i)a[i]=qread(),c[i]=(i-1)/cl+1,ed[c[i]]=i,pre[i]=pre[i-1]+a[i];
	for(int i=1;i<=n;++i)b[i]=col[i]=qread();
	m=n;
	for(int i=1;i<=q;++i)
	{
		cz[i][0]=qread();
		cz[i][1]=qread();
		cz[i][2]=qread();
		if(cz[i][0]==2) b[++m]=cz[i][2];
	}
	sort(b+1,b+1+m);
	m=unique(b+1,b+1+m)-b-1;
	for(int i=n;i;--i)col[i]=lower_bound(b+1,b+1+m,col[i])-b,st[c[i]]=i;
	for(int i=1;i<=q;++i)if(cz[i][0]==2)cz[i][2]=lower_bound(b+1,b+1+m,cz[i][2])-b;
	solve();
	for(int i=1;i<=q;++i)
	{
		if(cz[i][0]==1)
		{
			solve();
			Q(i);
		}
		else col[cz[i][1]]=cz[i][2];
	}
	return 0;
}