#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll inf = 3e18;

namespace SegmentTree {
    vector<int> t;
    int sz = 1;

    void init(int n, vector<int> nxt) {
        sz = 1 << __lg(n) + !!(n & (n - 1));
        t.assign(sz << 1, 1e9);
        for (int i = 0; i < n; ++i) {
            t[i + sz] = nxt[i];
        }
        for (int i = sz - 1; i > 0; --i) {
            t[i] = min(t[i << 1], t[i << 1 | 1]);
        }
    }

    void modify(int x, int v) {
        t[x += sz] = v;
        while (x >>= 1) {
            t[x] = min(t[x << 1], t[x << 1 | 1]);
        }
    }

    int rangeMin(int l, int r) {
        int ans = 1e9;
        for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
            if (l & 1) ans = min(ans, t[l++]);
            if (r & 1) ans = min(ans, t[--r]);
        }
        return ans;
    }

    int descend(int mn) { //find max i such as nxt[i] < mn
        if (t[1] >= mn) {
            return -1;
        }

        int x = 1;

        while (x < sz) {
            if (t[x << 1 | 1] < mn) {
                x = x << 1 | 1;
            } else {
                x = x << 1;
            }
        }

        return x - sz;
    }
};

int stk[1000000], top = 0;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, q;
    cin >> n >> m >> q;

    vector<ll> pref(n + 1);

    for (int i = 1; i <= n; ++i) {
        cin >> pref[i];
        pref[i] += pref[i - 1];
    }

    vector<int> c(n), nxt(n, n), last(m, -1);
    vector<set<int>> st(m);

    for (int i = 0; i < m; ++i) {
        st[i].insert(-1);
        st[i].insert(n);
    }

    for (int i = 0; i < n; ++i) {
        cin >> c[i];
        c[i] -= 1;
        st[c[i]].insert(i);

        if (last[c[i]] != -1) {
            nxt[last[c[i]]] = i;
        }
        last[c[i]] = i;
    }

    SegmentTree::init(n, nxt);

    constexpr int B = 200;

    vector<ll> blockPref(n);

    const int S = (n + B - 1) / B;
    vector<int> pr(n, -1), fi(S, -1);

    auto update = [&](int b) { //update block b
        int l = b * B, r = min(n, (b + 1) * B);
        if (l >= n) {
            return;
        }

        top = 0;

        for (int i = l; i < r; ++i) {
            while (top && nxt[stk[top - 1]] >= nxt[i]) {
                --top;
            }
            stk[top++] = i;
        }

        ll ans = 0;
        for (int i = 0; i < top; ++i) {
            if (i > 0) {
                ans = max(ans, pref[nxt[stk[i]]] - pref[stk[i - 1] + 1]);
            }
            blockPref[stk[i]] = ans;
        }

        pr[stk[0]] = SegmentTree::descend(nxt[stk[0]]);
        fi[b] = stk[0];

        for (int k = b + 1; k <= min(S - 1, b + 3); ++k) {
            if (fi[k] != -1) {
                pr[fi[k]] = SegmentTree::descend(nxt[fi[k]]);
            }
        }
    };

    auto modify = [&](int x, int to) {
        nxt[x] = to;
        SegmentTree::modify(x, to);
        update(x / B);
    };

    auto replace = [&](int x, int col) {
        if (c[x] == col) {
            return;
        }

        st[c[x]].erase(x);
        st[col].insert(x);

        int p = *prev(st[c[x]].lower_bound(x));
        int np = *prev(st[col].lower_bound(x));
        int nx = *st[col].upper_bound(x);
        int npx = *st[c[x]].upper_bound(p);

        if (p != -1) {
            modify(p, npx);
        }
        if (np != -1) {
            modify(np, x);
        }
        modify(x, nx);

        c[x] = col;
    };

    auto query = [&](int l, int r) { // [l, r)
        int i = SegmentTree::descend(r);
        if (i < l) {
            return pref[r] - pref[l];
        }

        ll ans = pref[r] - pref[i + 1];
        r = i;

        while (r - l >= B) {
            int b = r / B;
            if (r == fi[b]) {
                i = max(l - 1, pr[r]);
                ans = max(ans, pref[nxt[r]] - pref[i + 1]);
                r = i;
            } else {
                ans = max(ans, blockPref[r]);
                r = fi[b];
            }
        }

        if (r >= l) {
            int mn = SegmentTree::rangeMin(r, n);
            while (r >= l) {
                mn = min(mn, nxt[r]);
                ans = max(ans, pref[mn] - pref[r]);
                r -= 1;
            }
        }

        return ans;
    };

    for (int i = 0; i * B < n; ++i) {
        update(i);
    }

    while (q--) {
        int tp, a, b;
        cin >> tp >> a >> b;
        a -= 1, b -= 1;

        if (tp == 1) {
            cout << query(a, b + 1) << '\n';
        } else {
            replace(a, b);
        }
    }

    return 0;
}