#include <bits/stdc++.h>
using namespace std;

#ifdef ONLINE_JUDGE
#define freopen(...) 0
#endif
#define IO(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout),\
	cin.tie(0)->sync_with_stdio(0), cout.tie(0)
#define F(i, a, b) for (int i = (a), iee = (b); i <= iee; i++)
#define R(i, a, b) for (int i = (a), iee = (b); i >= iee; i--)
#define fi first
#define se second
using ll = long long;
using pr = pair<ll, int>;

const int N = 200100;
int n, m, q, b[N], c[N];
ll a[N];
int nxt[N];
set<int> pos[N];

#define lc p << 1
#define rc p << 1 | 1
#define mid ((l + r) >> 1)
int mn[N << 2];
ll res[N << 2];
ll query(int z, int l, int r, int p) {
	if (z < mn[p]) return 0;
	if (l == r) return a[z] - a[l];
	if (z < mn[rc])
		return query(z, l, mid, lc);
	else
		return min(query(z, mid + 1, r, rc), res[p]);
}
ll query(int x, int y, int &z, int l, int r, int p) {
	if (x > r || y < l || z < mn[p]) return 0;
	if (x <= l && y >= r) {
		ll ret = query(z, l, r, p);
		z = min(z, mn[p] - 1);
		return ret;
	}
	ll u = query(x, y, z, mid + 1, r, rc);
	ll v = query(x, y, z, l, mid, lc);
	return max(u, v);
}
void modify(int x, int k, int l, int r, int p) {
	if (x < l || x > r) return;
	if (l == r) { mn[p] = k; return; }
	modify(x, k, l, mid, lc), modify(x, k, mid + 1, r, rc);
	mn[p] = min(mn[lc], mn[rc]);
	res[p] = query(mn[rc] - 1, l, mid, lc);
}

void modify(int x, int y) {
	nxt[x] = y;
	modify(x, y, 1, n, 1);
}

int main() {
	IO(machine);
	cin >> n >> m >> q;
	F(i, 1, n) cin >> a[i], a[i] += a[i - 1];
	F(i, 1, m) pos[i] = {0, n + 1};
	F(i, 1, n) cin >> c[i], pos[c[i]].insert(i);
	F(i, 1, n) modify(i, *pos[c[i]].upper_bound(i));

	F(i, 1, q) {
		int op, x, y;
		cin >> op >> x >> y;
		if (op == 1) {
			int z = y;
			ll ans = query(x, y, z, 1, n, 1);
			ans = max(ans, a[z] - a[x - 1]);
			cout << ans << "\n";
		} else {
			if (c[x] == y) continue;
			auto it = pos[c[x]].find(x);
			modify(*prev(it), *next(it));
			pos[c[x]].erase(x);
			c[x] = y;
			pos[c[x]].insert(x);
			it = pos[c[x]].find(x);
			modify(*prev(it), x), modify(x, *next(it));
		}
	}
}