#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read() {
    int x = 0;
    char c = getchar();
    bool f = 0;
    while(!isdigit(c)) f |= (c == '-'), c = getchar();
    while(isdigit(c)) x = (x * 10) + (c ^ 48), c = getchar();
    return f ? -x : x;
}
const int maxn = 2 * 1e5 + 5, INF = 1e18 + 7;
int n, m, Q;
int a[maxn], c[maxn], Sum[maxn], Nex[maxn];
set <int> Col[maxn];
struct node {
    int Ans, LAns, MinNex;
}Tree[maxn << 2];
#define lc(i) i << 1
#define rc(i) i << 1 | 1
inline int Push_Up2(int i, int l, int r, int RMin) {
    if(l == r) { 
        RMin = min(RMin, Tree[i].MinNex);
        return Sum[RMin] - Sum[l]; 
    }
    int mid = (l + r) >> 1, rmin = Tree[rc(i)].MinNex;
    if(RMin <= rmin) return max(Sum[RMin] - Sum[mid + 1], Push_Up2(lc(i), l, mid, RMin));
    else return max(Tree[i].LAns, Push_Up2(rc(i), mid + 1, r, RMin));
}
inline void Push_Up(int i, int l, int r) {
    int mid = (l + r) >> 1;  
    Tree[i].MinNex = min(Tree[lc(i)].MinNex, Tree[rc(i)].MinNex);
    Tree[i].LAns = Push_Up2(lc(i), l, mid, Tree[rc(i)].MinNex);
    Tree[i].Ans = max(Tree[i].LAns, Tree[rc(i)].Ans);
}
inline void Update(int i, int l, int r, int x, int num) {
    if(l == r) { Tree[i].MinNex = num, Tree[i].Ans = Sum[num] - Sum[l]; return ; }
    int mid = (l + r) >> 1;
    if(x <= mid) Update(lc(i), l, mid, x, num);
    else Update(rc(i), mid + 1, r, x, num);
    Push_Up(i, l, r);
}
inline int Query2(int i, int l, int r, int RMin) {
    if(l == r) { 
        RMin = min(RMin, Tree[i].MinNex);
        return Sum[RMin] - Sum[l]; 
    }
    int mid = (l + r) >> 1, rmin = Tree[rc(i)].MinNex;
    if(RMin <= rmin) return max(Sum[RMin] - Sum[mid + 1], Query2(lc(i), l, mid, RMin));
    else return max(Tree[i].LAns, Query2(rc(i), mid + 1, r, RMin));
}
int RMin;
inline int Query(int i, int l, int r, int ql, int qr) {
    if(l >= ql && r <= qr) { 
        int mid = (l + r) >> 1, Ans = Query2(i, l, r, RMin);
        RMin = min(RMin, Tree[i].MinNex);
        return Ans;
    }
    int mid = (l + r) >> 1, Ans = 0;
    if(qr > mid) Ans = max(Ans, Query(rc(i), mid + 1, r, ql, qr));
    if(ql <= mid) Ans = max(Ans, Query(lc(i), l, mid, ql, qr));
    return Ans;
}
inline void Delet(int i) {
    auto pos = Col[c[i]].lower_bound(i), pre = pos, nex = pos;
    ++nex, --pre;
    Nex[*pre] = *nex;
    Col[c[i]].erase(pos);
}
inline void Insert(int i, int col) {
    auto pos = Col[col].lower_bound(i), pre = pos, nex = pos;
    --pre;
    Nex[*pre] = i, Nex[i] = *nex;
    Col[col].emplace(i);
}
signed main() {
    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 <= m; ++i) Col[i].emplace(n + 1);
    for(register int i = 1; i <= n; ++i) c[i] = read();
    for(register int i = n; i >= 1; --i) {
        int pos = *Col[c[i]].lower_bound(i);
        Nex[i] = pos, Col[c[i]].emplace(i), Update(1, 1, n, i, Nex[i]);
//        printf("%d %d\n", i, Nex[i]);
    }
    while(Q--) {
        int op = read(), l = read(), r = read(); RMin = r + 1;
        if(op == 1) printf("%lld\n", Query(1, 1, n, l, r));
        else Delet(l), Insert(l, r), Update(1, 1, n, l, Nex[l]);
    }
    return 0;
}