#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#define RF(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)

using namespace std;
using LL = long long;
using Pii = pair<int, int>;
using Pll = pair<LL, LL>;

const int kN = 2e5 + 1;

struct E {
  int mx;
  LL rv;
} e[kN << 2];
int n, m, q, a[kN], c[kN], pr[kN];
LL s[kN];
set<int> b[kN];

LL S(int x, int l, int r, int v) {
  if (l == r) {
    return s[l] - s[max(pr[l], v)];
  }
  int m = l + r >> 1;
  if (v > e[x * 2].mx) {
    return max(s[m] - s[v], S(x * 2 + 1, m + 1, r, v));
  }
  return max(S(x * 2, l, m, v), e[x].rv);
}
void Pu(int x, int l, int r) {
  int m = l + r >> 1;
  e[x].mx = max(e[x * 2].mx, e[x * 2 + 1].mx);
  e[x].rv = S(x * 2 + 1, m + 1, r, e[x * 2].mx);
}
void B(int x, int l, int r) {
  if (l == r) {
    e[x].mx = pr[l];
    return;
  }
  int m = l + r >> 1;
  B(x * 2, l, m), B(x * 2 + 1, m + 1, r);
  Pu(x, l, r);
}
void U(int x, int l, int r, int t, int v) {
  if (l == r) {
    e[x].mx = v;
    return;
  }
  int m = l + r >> 1;
  if (t <= m) {
    U(x * 2, l, m, t, v);
  } else {
    U(x * 2 + 1, m + 1, r, t, v);
  }
  Pu(x, l, r);
}
vector<pair<int, Pii>> ql;
void Q(int x, int l, int r, int tl, int tr) {
  if (l == tl && r == tr) {
    ql.push_back({x, {l, r}});
    return;
  }
  int m = l + r >> 1;
  if (tl <= m) {
    Q(x * 2, l, m, tl, min(m, tr));
  }
  if (m < tr) {
    Q(x * 2 + 1, m + 1, r, max(m + 1, tl), tr);
  }
}

int main() {
  RF("ex_machine2");
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m >> q;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    s[i] = s[i - 1] + a[i];
  }
  for (int i = 1; i <= m; ++i) {
    b[i].insert(0);
  }
  for (int i = 1; i <= n; ++i) {
    cin >> c[i];
    pr[i] = *b[c[i]].rbegin();
    b[c[i]].insert(i);
  }
  B(1, 1, n);
  for (int o, l, r; q--;) {
    cin >> o >> l >> r;
    if (o == 1) {
      ql.clear();
      Q(1, 1, n, l, r);
      int mx = l - 1;
      LL ans = 0;
      for (auto [x, i] : ql) {
        ans = max(ans, S(x, i.first, i.second, mx));
        mx = max(mx, e[x].mx);
      }
      cout << ans << '\n';
    } else {
      auto p = b[c[l]].find(l);
      ++p;
      if (p != b[c[l]].end()) {
        pr[*p] = pr[l], U(1, 1, n, *p, pr[l]);
      }
      b[c[l]].erase(l);
      c[l] = r;
      p = b[c[l]].insert(l).first;
      ++p;
      if (p != b[c[l]].end()) {
        pr[l] = pr[*p], U(1, 1, n, l, pr[*p]);
        pr[*p] = l, U(1, 1, n, *p, l);
      } else {
        --p, --p;
        pr[l] = *p, U(1, 1, n, l, *p);
      }
    }
  }
  return 0;
}