#include<bits/stdc++.h>
#define int long long
inline int read()
{   int x=0;
    bool f=0;
    char c=getchar();
    while(!isdigit(c))f|=(c=='-'),c=getchar();
    while(isdigit(c))x=x*10+(c&15),c=getchar();
    return f?-x:x;
}
using namespace std;
int n,m,q,a[200005],id[200005],c[200005],sum[200005][25],maxn;
bool bj[200005];
inline int get_max(int l,int r)
{   int cnt=log2(r-l+1);
    return max(sum[l][cnt],sum[r-(1<<cnt)+1][cnt]);
}
signed main()
{   //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();
    for(register int i=1;i<=n;++i)c[i]=read();
    if(n<=5000&&m<=5000)
    {   for(register int i=1,op,l,r;i<=q;++i)
        {   op=read(),l=read(),r=read();
            if(op==1)
            {   maxn=0;
                int now=0,last=l;
                for(register int j=l;j<=r;++j)
                {   while(last<=r&&bj[c[last]]==0)
                    {   bj[c[last]]=1;
                        now+=a[last];
                        last++;
                    }
                    maxn=max(maxn,now);
                    now-=a[j];
                    bj[c[j]]=0;
                }
                printf("%lld\n",maxn);
            }
            else c[l]=r;
        }
    }
    else
    {   int now=0,last=1;
        for(register int j=1;j<=n;++j)
        {   while(last<=n&&bj[c[last]]==0)
            {   bj[c[last]]=1;
                now+=a[last];
                last++;
            }
            id[last]=j;
            sum[j][0]=now;
            now-=a[j];
            bj[c[j]]=0;
        }
        int len=log2(n);
        for(register int i=1;i<=len;++i)
        {   int up=n-(1<<i)+1;
            for(register int j=1;j<=up;++j)
                sum[j][i]=max(sum[j][i-1],sum[j+(1<<(i-1))][i-1]);
        }
        for(register int i=1,op,l,r;i<=q;++i)
        {   op=read(),l=read(),r=read();
            printf("%lld\n",get_max(l,id[r+1]));
        }
    }
}