#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5;
const ll inf=1e18;

inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0' || ch>'9')
    {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}

int n,m,q,val[Maxn+5],col[Maxn+5],pre[Maxn+5];
ll sum[Maxn+5]; set<int> st[Maxn+5];

struct Node
{
    int id,l,r,pos,mx; ll val,rval,ans,hzh;
    inline void Print()
    {
        printf("%d %d %d: %d %d %lld %lld %lld %lld\n",id,l,r,pos,mx,val,rval,ans,hzh);
    }
} t[Maxn*4+5];
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)

inline ll GetHzh(int p,int k)
{
    int l=t[p].l,r=t[p].r,mid=(l+r)>>1;
    if(l==r) return sum[l]-sum[max(k,pre[l])];
    if(k<=t[ls(p)].mx) return max(t[p].rval,GetHzh(ls(p),k));
    else return max(sum[mid]-sum[k],GetHzh(rs(p),k));
}
inline ll GetAns(int p,int k)
{
    int l=t[p].l,r=t[p].r,mid=(l+r)>>1;
    if(l==r) return sum[l]-sum[max(pre[l],k-1)];
    if(t[ls(p)].mx<k) return max(sum[mid]-sum[k-1],GetAns(rs(p),k));
    else return max(GetAns(ls(p),k),t[p].rval);
}
inline Node operator+(Node a,Node b)
{
    if(!a.l) return b;
    Node c;
    c.mx=max(a.mx,b.mx);
    c.val=a.val+b.val;
    c.l=a.l,c.r=b.r;
    c.rval=GetHzh(b.id,a.mx);
    c.hzh=max(a.hzh,c.rval);
    c.pos=b.pos;
    if(b.pos==b.l) c.pos=max(a.pos,b.mx+1);
    c.ans=max(a.ans,b.ans);
    c.ans=max(c.ans,GetAns(b.id,a.pos));
    return c;
}
inline void push_up(int p) {t[p]=t[ls(p)]+t[rs(p)],t[p].id=p;}
inline void Build(int l,int r,int p)
{
    t[p].l=l,t[p].r=r;
    if(l==r) {t[p]=(Node){p,l,r,l,pre[l],val[l],-inf,val[l],sum[l]-sum[pre[l]]}; return;}
    int mid=(l+r)>>1;
    Build(l,mid,ls(p)),Build(mid+1,r,rs(p)),push_up(p);
}
inline void Modify(int l,int r,int p,int pos,int k)
{
    // if(l==r) printf("opt %d: %d\n",pos,k);
    if(l==r) {t[p].mx=k,t[p].hzh=sum[l]-sum[k]; return;}
    int mid=(l+r)>>1;
    if(pos<=mid) Modify(l,mid,ls(p),pos,k);
    else Modify(mid+1,r,rs(p),pos,k);
    push_up(p);
}
inline Node Count(int nl,int nr,int l,int r,int p)
{
    if(l<=nl && nr<=r) return t[p];
    int mid=(nl+nr)>>1; Node res; res.l=0;
    if(l<=mid) res=res+Count(nl,mid,l,r,ls(p));
    if(r>mid) res=res+Count(mid+1,nr,l,r,rs(p));
    return res;
}

int main()
{
   // freopen("a.in","r",stdin);
  //  freopen("a.out","w",stdout);

    n=read(),m=read(),q=read();
    For(i,1,m) st[i].insert(0);
    For(i,1,n) val[i]=read();
    For(i,1,n) col[i]=read();
    For(i,1,n)
    {
        sum[i]=sum[i-1]+val[i];
        pre[i]=*--st[col[i]].end(),st[col[i]].insert(i);
    }
    For(i,1,m) st[i].insert(n+1);
    Build(1,n,1);
    while(q--)
    {
        int opt=read(),a=read(),b=read();
        if(opt==1) printf("%d\n",Count(1,n,a,b,1).ans);
        if(opt==2)
        {
            if(col[a]==b) continue;
            int x=*st[col[a]].upper_bound(a);
            int y=*--st[col[a]].lower_bound(a);
            int z=*--st[b].lower_bound(a);
            int s=*st[b].upper_bound(a);
            if(x<=n) pre[x]=y,Modify(1,n,1,x,y);
            st[col[a]].erase(a),st[b].insert(a);
            col[a]=b,pre[a]=z,Modify(1,n,1,a,z);
            if(s<=n) pre[s]=a,Modify(1,n,1,s,a);
        }
    }
    return 0;
}