#include<bits/stdc++.h>
using namespace std;
#define N 200009
inline int read()
{
    register int x=0;
    register char ch=cin.get();
    register bool op=0;
    while(!isdigit(ch)) {if(ch=='-')op=1;ch=cin.get();}
    while(isdigit(ch)) {(x*=10)+=(ch^48);ch=cin.get();}
    return op? -x:x;
}
int n,m,q;
int sum[N];
long long a[N],c[N];
int s[N],cnt;
int main()
{
    ios::sync_with_stdio(0);
    // freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    n=read(),m=read(),q=read();
    for(register int i(1);i<=n;++i) a[i]=read(),sum[i]=sum[i-1]+a[i];
    for(register int i(1);i<=n;++i) c[i]=read();
    for(register int i(1),op;i<=q;++i)
    {
        op=read();
        if(op==1) 
        {
            long long ans=0,k=0;
            int l=read(),r=read();cnt=0;
            for(register int i(l);i<=r;++i) 
            if(c[i]==c[i+1]) 
            {
                s[++cnt]=i;
                while(c[i]==c[i+1]) ++i;
                s[++cnt]=i;
            }
            if(s[cnt]!=r) s[++cnt]=r;
            for(register int i(1);i<=cnt;++i) 
            {
                if(i&1) {k=sum[s[i]]-sum[s[i-1]-1];}
                else {for(register int j(s[i-1]);j<=s[i];++j)k=max(a[j],k);}
                ans=max(k,ans);
                k=0;
            }
            printf("%lld\n",ans);
        }
        if(op==2) c[read()]=read();
    }
    return 0;
}