#include <bits/stdc++.h>
namespace IO {
#define iL (1 << 20)
char ibuf[iL], *iS = ibuf + iL, *iT = ibuf + iL;
#define gc() ((iS == iT) ? (iT = (iS = ibuf) + fread(ibuf, 1, iL, stdin), iS == iT ? EOF : *iS ++) : *iS ++)
template<class T> inline void read(T &x) {
	x = 0;int f = 0;char ch = gc();
	for (; !isdigit(ch); f |= ch == '-', ch = gc());
	for (; isdigit(ch); x = (x << 1) + (x << 3) + (ch ^ 48), ch = gc());
	x = (f == 1 ? ~ x + 1 : x);
}
template<class T, class... Args> inline void read(T &x, Args&... args) { read(x), read(args...); }
template<class T> inline void readch(T &x) { char ch = gc(); for (; !isalpha(ch); ch = gc()); x = ch; }
char Out[iL], *iter = Out;
#define flush() fwrite(Out, 1, iter - Out, stdout), iter = Out
template<class T> inline void write(T x, char ch = '\n') {
	T l, c[35];
	if (x < 0) *iter ++ = '-', x = ~ x + 1;
	for (l = 0; !l || x; c[l] = x % 10, l++, x /= 10);
	for (; l; -- l, *iter ++ = c[l] + '0');*iter ++ = ch;
	flush();
}
} // IO
using namespace IO;
#define N 200005
#define ll long long
#define DEBUG
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define lc(k) (k << 1)
#define rc(k) (k << 1 | 1)
using namespace std;
int n, m, q, a[N], c[N], pre[N], lst[N]; ll ms[N];
int mx[N * 4], tag[N * 4]; ll sum[N]; set<int> col[N];
void modsum(int k, int l, int r, int x, ll v) {
	if (l == r) { ms[k] = v; return ; }
	int mid = l + r >> 1;
	(x <= mid) ? modsum(lc(k), l, mid, x, v) : modsum(rc(k), mid + 1, r, x, v);
	ms[k] = max(ms[lc(k)], ms[rc(k)]);
}
ll quesum(int k, int l, int r, int x, int y) {
	if (x <= l && r <= y) return ms[k];
	if (x > r || l > y) return 0;
	int mid = l + r >> 1;
	return max(quesum(lc(l), l, mid, x, y), quesum(rc(k), mid + 1, r, x, y));
}

pii rmx[N], rtg[N], rpos[N]; int del = 0, delv = 0; unordered_map<int, int> vis, vpos;
void addtag(int k, int l, int r, int v) { 
	if (!vis[k]) {
		rmx[++ del] = mp(k, mx[k]); rtg[del] = mp(k, tag[k]);
		vis[k] = 1;
	}
	mx[k] = max(mx[k], v), tag[k] = max(tag[k], v); 
	if (l == r) {
		if (!vpos[l]) rpos[++ delv] = mp(l, k);
		modsum(1, 1, n, l, sum[l] - sum[mx[k]]);
	}
}
void pushdown(int k, int l, int r) { 
	int mid = l + r >> 1;
	if (tag[k]) addtag(lc(k), l, mid, tag[k]), addtag(rc(k), mid + 1, r, tag[k]); tag[k] = 0; 
}
void modify(int k, int l, int r, int x, int y, int v) {
	if (x <= l && r <= y) { addtag(k, l, r, v); return ; }
	if (x > r || l > y) return ;
	int mid = l + r >> 1; pushdown(k, l, r);
	modify(lc(k), l, mid, x, y, v), modify(rc(k), mid + 1, r, x, y, v);
	mx[k] = max(mx[lc(k)], mx[rc(k)]);
	if (!vis[k]) {
		rmx[++ del] = mp(k, mx[k]); rtg[del] = mp(k, tag[k]);
		vis[k] = 1;
	}
}
int query(int k, int l, int r, int x) { // find the first position mx[i] >= x, or return n
	if (l == r) return l;
	int mid = l + r >> 1; pushdown(k, l, r);
	if (mx[lc(k)] >= x) return query(lc(k), l, mid, x);
	return query(rc(k), mid + 1, r, x);
}
// why it is 3 log???
// 2 log。
vector<pii> chg[N * 4]; pii qry[N];
void pushchange(int k, int l, int r, int x, int y, pii v) {
	if (x <= l && r <= y) { chg[k].push_back(v); return ; }
	if (x > r || l > y) return ;
	int mid = l + r >> 1; 
	pushchange(lc(k), l, mid, x, y, v), pushchange(rc(k), mid + 1, r, x, y, v);
}
void getans(int k, int l, int r) {
	vis.clear(), vpos.clear();
	static pii trmx[N], trtg[N], trpos[N]; int tot = 0, totv = 0;
	for (auto it : chg[k]) modify(1, 1, n, it.fi, n, it.se);
	tot = del; for (int i = 1; i <= tot; i++) trmx[i] = rmx[i], trtg[i] = rtg[i];
	totv = delv; for (int i = 1; i <= totv; i++) trpos[i] = rpos[i];
	if (l == r) {
		if (!qry[l].fi) return ;
		int pos = query(1, 1, n, qry[l].fi - 1);
		ll ans = 0; if (pos <= qry[l].se) ans = quesum(1, 1, n, pos, qry[l].se);
		ans = max(ans, sum[pos - 1] - sum[l - 1]); write(ans);
		return ;
	}
	int mid = l + r >> 1; 
	getans(lc(k), l, mid), getans(rc(k), mid + 1, r);
	for (int i = tot; i >= 1; i--) {
		mx[trmx[i].fi] = trmx[i].se, tag[trtg[i].fi] = trtg[i].se;
	}
	for (int i = totv; i >= 1; i--) {
		modsum(1, 1, n, trpos[i].fi, sum[trpos[i].fi] - sum[mx[trpos[i].se] - 1]);
	}
}
int main() {
#ifndef ONLINE_JUDGE
	freopen("test.in", "r", stdin); freopen("test.out", "w", stdout);
#endif
	read(n, m, q); for (int i = 1; i <= n; i++) read(a[i]), sum[i] = sum[i - 1] + a[i]; 
	for (int i = 1; i <= n; i++) {
		read(c[i]); if (col[c[i]].size()) pre[i] = *col[c[i]].rbegin(); col[c[i]].insert(i);
	}
	for (int i = 1, op, l, r; i <= q; i++) {
		read(op, l, r);
		if (op == 1) { qry[i] = mp(l, r); }  
		else {
			pushchange(1, 1, q, lst[l] + 1, i - 1, mp(l, pre[l])); lst[l] = i - 1;
			col[c[l]].erase(l); auto it = col[c[l]].lower_bound(l); 
			if (it != col[c[l]].end()) {
				pushchange(1, 1, q, lst[*it] + 1, i - 1, mp(*it, pre[*it])); 
				pre[*it] = pre[l];
			}
			c[l] = r; auto ir = col[c[l]].lower_bound(l); pre[l] = 0;
			if (ir != col[c[l]].end()) { 
				int y = *ir; pushchange(1, 1, q, lst[y] + 1, i - 1, mp(y, pre[y])); 
				pre[y] = l, lst[y] = i - 1; 
			} 
			if (ir != col[c[l]].begin()) { ir --; int x = *ir; pre[l] = x; }
			col[c[l]].insert(l);
		}
	}
	for (int i = 1; i <= n; i++) pushchange(1, 1, q, lst[i] + 1, n, mp(i, pre[i]));
	getans(1, 1, q);
	return 0;
}