// Author: lycc
// 
// Problem: # 5098. 第一代图灵机
// Contest: 
// URL: https://qoj.ac/problem/5098
// Memory Limit: 1024 MB
// Time Limit: 1000 ms

#include <bits/stdc++.h>
#define int long long
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pb emplace_back
#define For(i, x, y) for (int i = (x); i <= (y); i ++)
#define rep(i, x, y) for (int i = (x); i >= (y); i --)
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(v) (int)((v).size())
#define ull unsigned long long
#define ls (p << 1)
#define rs (p << 1 | 1)
#define mp make_pair
#define i128 __int128
#define db long double
#define vi vector< int >
#define mem(v, x) memset(v, x, sizeof(v))
#define A3 array< int, 3 >
#define A4 array< int, 4 >
#define vpii vector< pair< int, int > >
using namespace std;
mt19937_64 rnd(time(0));
template< typename T > void cmin(T &x, T y) { return x = min(x, y), void(); }
template< typename T > void cmax(T &x, T y) { return x = max(x, y), void(); }
int ksm(int x, int y, int p) {
    int v = 1; x %= p;
    while (y) v = 1ll * v * ((y & 1) ? x : 1) % p, x = 1ll * x * x % p, y >>= 1;
    return (v % p + p) % p;
}
void file() {
	freopen("1.in", "r", stdin);
	freopen("1.out", "w", stdout);
	return;
}
bool MemoryST;
const int N = 2e5 + 5;
const int mod = 998244353;
const long long INF = 1e18;
const int base = 13131;
using ll = long long;
int n, m, q;
int a[N];
set< int > pos[N];
int c[N];
int get(int p) {
	return *(pos[c[p]].ub(p)) - 1;
}
int nex[N];
struct ds1 {
	int minn[N * 4];
	void build(int l, int r, int p) {
		if (l == r) return minn[p] = nex[l], void();
		int mid = (l + r) >> 1;
		build(l, mid, ls); build(mid + 1, r, rs);
		minn[p] = min(minn[ls], minn[rs]);
		return;
	}
	void modify(int l, int r, int x, int p) {
		if (l == r) return minn[p] = nex[l], void();
		int mid = (l + r) >> 1;
		if (x <= mid) modify(l, mid, x, ls);
		else modify(mid + 1, r, x, rs);
		minn[p] = min(minn[ls], minn[rs]);
		return;
	}
	int query(int l, int r, int p, int v) {
		if (minn[p] > v) return -1;
		if (l == r) return l;
		int mid = (l + r) >> 1, res = query(mid + 1, r, rs, v);
		if (res != -1) return res;
		return query(l, mid, ls, v);
	}
} t1;
int lres[N * 4], minn[N * 4], ans[N * 4];
int query(int l, int r, int p, int v) {
	if (l == r) return a[min(nex[l], v)] - a[l - 1];
	int mid = (l + r) >> 1;
	if (minn[rs] <= v) return max(lres[ls], query(mid + 1, r, rs, v));
	return max(query(l, mid, ls, v), a[v] - a[mid]);
}
void build(int l, int r, int p) {
	if (l == r) return minn[p] = nex[l], ans[p] = a[nex[l]] - a[l - 1], void();
	int mid = (l + r) >> 1;
	build(l, mid, ls); build(mid + 1, r, rs);
	lres[p] = query(l, mid, ls, minn[rs]);
	minn[p] = min(minn[ls], minn[rs]);
	ans[p] = max(lres[p], ans[rs]);
	return;
} 
void modify(int l, int r, int x, int p) {
	if (l == r) return minn[p] = nex[l], ans[p] = a[nex[l]] - a[l - 1], void();
	int mid = (l + r) >> 1;
	if (x <= mid) modify(l, mid, x, ls);
	else modify(mid + 1, r, x, rs);
	lres[p] = query(l, mid, ls, minn[rs]);
	minn[p] = min(minn[ls], minn[rs]);
	ans[p] = max(lres[p], ans[rs]);
	return;	
}
int Minn, Ans;
void query(int l, int r, int x, int y, int p) {
	if (l >= x && r <= y) {
		if (Ans == -INF) Minn = minn[p], Ans = ans[p];
		else {
			cmax(Ans, query(l, r, p, Minn));
			cmin(Minn, minn[p]);
		}
		return;
	}
	int mid = (l + r) >> 1;
	if (y > mid) query(mid + 1, r, x, y, rs);
	if (x <= mid) query(l, mid, x, y, ls);
	return;
}
int Pre(int p, int col) {
	return *(prev(pos[col].lb(p)));
}
int Nex(int p, int col) {
	return *(pos[col].ub(p));
}
void Main() {
	cin >> n >> m >> q;
	For (i, 1, n) {
		cin >> a[i]; a[i] += a[i - 1];
	}
	For (i, 1, m) pos[i].insert(n + 1), pos[i].insert(0);
	For (i, 1, n) {
		cin >> c[i];
		pos[c[i]].insert(i);
	}
	For (i, 1, n) nex[i] = get(i);
	t1.build(1, n, 1); build(1, n, 1);
	while (q --) {
		int op; cin >> op;
		if (op == 1) {
			int l, r; cin >> l >> r;
			int p = t1.query(1, n, 1, r);
			if (p < l) {
				cout << a[r] - a[l - 1] << '\n';
				continue;
			}
			Minn = INF; Ans = -INF;
			query(1, n, l, p, 1);
			cmax(Ans, a[r] - a[p]);
			cout << Ans << '\n';
		} else {
			int x, v; cin >> x >> v;
			if (c[x] != v) {
				int i = Pre(x, c[x]), j = Nex(x, c[x]);
				if (i) nex[i] = j - 1, t1.modify(1, n, i, 1), modify(1, n, i, 1);
				pos[c[x]].erase(x);
				c[x] = v;
				i = Pre(x, c[x]); j = Nex(x, c[x]);
				if (i) nex[i] = x - 1, t1.modify(1, n, i, 1), modify(1, n, i, 1);
				nex[x] = j - 1; t1.modify(1, n, x, 1); modify(1, n, x, 1);
				pos[c[x]].insert(x);
			}
		}
	}
    return;
}
bool MemoryED;
signed main() {
	// file();
    ios :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cerr << fixed << setprecision(6) << (&MemoryST - &MemoryED) / 1048576.0 << "MB\n";
    int TESTCNT = 1;
    // cin >> TESTCNT;
    while (TESTCNT --) Main();
    cerr << endl << 1e3 * clock() / CLOCKS_PER_SEC << "ms"; 
    return 0;
}