// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n, m, q, c[200005], lst[200005];
long long s[200005];
std::set<int> e[200005];
struct node
{
    int max;
    long long r2l;
} t[1 << 19];
#define lson (now << 1)
#define rson (lson | 1)
#define lmid ((l + r) >> 1)
#define rmid (lmid + 1)
long long get(int val, int now, int l, int r)
{
    if (l == r)
        return s[l - 1] - s[val];
    if (val < t[lson].max)
        return std::max(get(val, lson, l, lmid), t[now].r2l);
    else
        return get(val, rson, rmid, r);
}
void pushup(int now, int l, int r)
{
    t[now].max = std::max(t[lson].max, t[rson].max);
    t[now].r2l = get(t[lson].max, rson, rmid, r);
}
void build(int now = 1, int l = 1, int r = n)
{
    if (l == r)
    {
        t[now].max = lst[l];
        return;
    }
    build(lson, l, lmid);
    build(rson, rmid, r);
    pushup(now, l, r);
}
void modify(int pos, int val, int now = 1, int l = 1, int r = n)
{
    if (l == r)
    {
        t[now].max = val;
        return;
    }
    if (pos <= lmid)
        modify(pos, val, lson, l, lmid);
    else
        modify(pos, val, rson, rmid, r);
    pushup(now, l, r);
}
long long query(int L, int R, int &max, int now = 1, int l = 1, int r = n)
{
    if (R < l || r < L)
        return 0;
    if (L <= l && r <= R)
    {
        int tmp = max;
        max = std::max(max, t[now].max);
        return get(tmp, now, l, r);
    }
    long long res = 0;
    res = std::max(res, query(L, R, max, lson, l, lmid));
    res = std::max(res, query(L, R, max, rson, rmid, r));
    return res;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m >> q;
    for (int i = 1; i <= n; ++i)
        std::cin >> s[i], s[i] += s[i - 1];
    for (int i = 1; i <= n; ++i)
        e[i].insert(0);
    for (int i = 1; i <= n; ++i)
    {
        std::cin >> c[i];
        lst[i] = *--e[c[i]].end();
        e[c[i]].insert(i);
    }
    build();
    for (int i = 1; i <= q; ++i)
    {
        static int opt, x, y;
        std::cin >> opt >> x >> y;
        switch (opt)
        {
        case 1:
        {
            int max = x - 1;
            long long ans = query(x, y, max);
            std::cout << std::max(ans, s[y] - s[max]) << '\n';
        }
        break;
        case 2:
        {
            std::set<int>::iterator iter = e[c[x]].find(x);
            e[c[x]].erase(iter++);
            if (iter != e[c[x]].end())
                modify(*iter, lst[*iter] = *std::prev(iter));
            iter = e[c[x] = y].insert(x).first;
            modify(x, lst[x] = *std::prev(iter));
            if (++iter != e[c[x]].end())
                modify(*iter, lst[*iter] = x);
        }
        break;
        }
    }
    return 0;
}