#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(i, x, y) for(int i = (x); i <= (y); i++)
#define ROF(i, x, y) for(int i = (x); i >= (y); i--)
inline int rd()
{
    int sign = 1, re = 0; char c = getchar();
    while(!isdigit(c)){if(c == '-') sign = -1; c = getchar();}
    while(isdigit(c)){re = re * 10 + (c - '0'); c = getchar();}
    return sign * re;
}
const int N = 2e5 + 5;
int n, m, q;
int c[N];
LL a[N], sum[N];
set<int> pos[N];
namespace Seg
{
    #define ls (now << 1)
    #define rs (now << 1 | 1)
    LL tr[N << 2]; int Mn[N << 2], Mx[N << 2];
    LL calc(int now, int l, int r, int id)
    {
        if(Mx[now] <= id) return tr[now];
        if(Mn[now] >= id) return sum[id - 1] - sum[l - 1];
        int mid = (l + r) >> 1;
        return max(calc(ls, l, mid, id), calc(rs, mid + 1, r, id));
    }
    LL query(int now, int l, int r, int L, int R, int &id)
    {
        if(L <= l && r <= R)
        {
            int re = calc(now, l, r, id + 1);
            id = min(id, Mn[now]);
            return re;
        }
        int mid = (l + r) >> 1; LL re = 0;
        if(mid < R) re = query(rs, mid + 1, r, L, R, id);
        if(L <= mid) re = max(re, query(ls, l, mid, L, R, id));
        return re;
    }
    void modify(int now, int l, int r, int x, int y)
    {
        if(x < l || x > r) return;
        if(l == r)
        {
            Mn[now] = Mx[now] = y;
            tr[now] = sum[y - 1] - sum[l - 1];
            return;
        }
        int mid = (l + r) >> 1;
        if(x <= mid) modify(ls, l, mid, x, y);
        else modify(rs, mid + 1, r, x, y);
        Mn[now] = min(Mn[ls], Mn[rs]), Mx[now] = max(Mx[ls], Mx[rs]);
        tr[now] = max(calc(ls, l, mid, Mn[rs]), tr[rs]);
    }
} using namespace Seg;
signed main()
{
#ifndef ONLINE_JUDGE
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif
    n = rd(), m = rd(), q = rd();
    FOR(i, 1, m) pos[i] = {0, n + 1};
    FOR(i, 1, n) a[i] = rd(), sum[i] = sum[i - 1] + a[i];
    FOR(i, 1, n) c[i] = rd(), pos[c[i]].insert(i);
    FOR(i, 1, n) modify(1, 1, n, i, *(pos[c[i]].upper_bound(i)));
    while(q--)
    {
        int ty = rd(), x = rd(), y = rd();
        if(ty == 1) printf("%lld\n", query(1, 1, n, x, y, y));
        else
        {
            auto it = pos[c[x]].lower_bound(x);
            modify(1, 1, n, *prev(it), *next(it));
            pos[c[x]].erase(it);
            it = pos[y].upper_bound(x);
            modify(1, 1, n, *prev(it), x);
            modify(1, 1, n, x, *it);
            c[x] = y, pos[y].insert(x);
        }
    }
    return 0;
}