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

#define fo(i,a,b) for(int i=a;i<=b;++i)
#define ll long long

const int N = 2e5 + 5;

int n, m, q;
ll a[N];
int c[N];
int mx[N * 2], lc[N * 2], rc[N * 2];
int lzy[N * 2], tl = 0;
ll sum[N * 2];
set<int> clr[N];

void build(int l, int r) {
	int now = ++tl;
	lc[now] = rc[now] = mx[now] = 0, lzy[now] = -1;
	if(l < r) {
		int mid = (l + r) / 2;
		lc[now] = tl + 1; build(l, mid);
		rc[now] = tl + 1; build(mid + 1, r);
	}
	return;
}

void pushdown(int l, int r, int x) {
	if(lzy[x] != -1) {
		int L = lc[x], R = rc[x];
		lzy[L] = lzy[R] = lzy[x];
		sum[L] = a[(l + r) / 2] - a[x];
		sum[R] = a[r] - a[x];
		lzy[x] = -1;
	}
	return;
}

void change(int l, int r, int k, int x) {
	if(x >= mx[k]) {
		lzy[k] = x;
		sum[k] = a[r] - a[x];
		return;
	}
	if(l == r) {
		sum[k] = a[r] - a[mx[k]];
		return;
	}
	pushdown(l, r, k);
	int mid = (l + r) / 2;
	if(mx[lc[k]] >= x) {
		change(l, mid, lc[k], x);
	} else {
		change(l, mid, lc[k], x);
		change(mid + 1, r, rc[k], x);
	}
	sum[k] = max(sum[lc[k]], sum[rc[k]]);
	return;
}

void modify(int l, int r, int k, int x, int y) {
	if(l == r) {
		mx[k] = y;
		sum[k] = a[r] - a[y];
		return;
	}
	pushdown(l, r, k);
	int mid = (l + r) / 2;
	if(x <= mid) modify(l, mid, lc[k], x, y);
	else modify(mid + 1, r, rc[k], x, y);
	change(mid + 1, r, rc[k], mx[lc[k]]);
	sum[k] = max(sum[lc[k]], sum[rc[k]]);
	mx[k] = max(mx[lc[k]], mx[rc[k]]);
	return;
}

int querypre(int l, int r, int k, int x) {
	if(r <= x) return mx[k];
	if(l > x) return 0;
	int mid = (l + r) / 2;
	return max(querypre(l, mid, lc[k], x), querypre(mid + 1, r, rc[k], x));
}

ll query(int l, int r, int k, int L, int R) {
	if(l > R || L > r || L > R) return 0;
	if(l >= L && r <= R) return sum[k];
	pushdown(l, r, k);
	int mid = (l + r) / 2;
	return max(query(l, mid, lc[k], L, R), query(mid + 1, r, rc[k], L, R));
}

int main() {
	scanf("%d %d %d", &n, &m, &q);
	fo(i, 1, m) clr[i].insert(0), clr[i].insert(n + 1);
	fo(i, 1, n) {
		scanf("%lld", &a[i]);
		a[i] += a[i - 1];
	}
	build(1, n);
	fo(i, 1, n) {
		scanf("%d", &c[i]);
		auto it = clr[c[i]].insert(i).first;
		--it;
		modify(1, n, 1, i, *it);
//		printf("pre %d = %d %d\n", i, *it, sum[5]);
	}
	fo(i, 1, q) {
		int ty, u, v;
		scanf("%d %d %d", &ty, &u, &v);
		if(ty == 1) {
			int l = u, r = v, res = u - 1;
			while(l <= r) {
				int mid = (l + r) / 2;
				if(querypre(1, n, 1, mid) < u - 1) l = mid + 1, res = mid;
				else r = mid - 1;
			}
//			printf("R %d\n", res);
			ll ans = a[res] - a[u - 1];
			ans = max(ans, query(1, n, 1, res + 1, v));
			printf("%lld\n", ans);
		} else {
			modify(1, n, 1, u, 0);
			auto it = clr[c[u]].upper_bound(u);
			if((*it) != n + 1) {
				int la = *it, lb;
				--it, --it;
				lb = *it;
				modify(1, n, 1, la, lb);
//				printf("pre %d = %d\n", la, lb);
			}
			it = clr[v].upper_bound(u);
			int la = *it, lb;
			--it;
			lb = *it;
			if(la != n + 1) modify(1, n, 1, la, u);//, printf("pre %d = %d\n", la, u);
			modify(1, n, 1, u, lb);//, printf("pre %d = %d\n", u, lb);
			c[u] = v;
		}
	}
	return 0;
}