// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
#define SZ(x) ((int)x.size())
using namespace std;
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int mod=998244353,maxn=500005;
int pre[maxn],n,m,zsy,c[maxn];
#define ls (o<<1)
#define rs (o<<1|1)
ll sum[maxn],a[maxn];
int mx[maxn<<2];
set<int>st[maxn];
ll t1[maxn<<2],t2[maxn<<2];
ll dfs(int o,int l,int r,int lim){
	if(l==r)return mx[o]>=lim?t1[o]:sum[l]-sum[lim];
	int mid=(l+r)>>1;
	if(mx[ls]>=lim)return max(t2[o],dfs(ls,l,mid,lim));
	return max(sum[mid]-sum[lim],dfs(rs,mid+1,r,lim));
}
void build(int o,int l,int r){
	if(l==r)return mx[o]=pre[l],t1[o]=t2[o]=sum[l]-sum[pre[l]],void();
	int mid=(l+r)>>1; build(ls,l,mid),build(rs,mid+1,r);
	mx[o]=max(mx[ls],mx[rs]),t1[o]=max(t1[rs],t2[rs]),t2[o]=dfs(rs,mid+1,r,mx[ls]);
}
void update(int o,int l,int r,int pos,int val){
	if(l==r)return mx[o]=val,t1[o]=t2[o]=sum[l]-sum[val],void();
	int mid=(l+r)>>1;
	(pos<=mid)?update(ls,l,mid,pos,val):update(rs,mid+1,r,pos,val);
	mx[o]=max(mx[ls],mx[rs]),t1[o]=max(t1[rs],t2[rs]),t2[o]=dfs(rs,mid+1,r,mx[ls]);
}
#define node pair<int,ll>
void query(int o,int l,int r,int ql,int qr,node &res){
	if(ql<=l&&qr>=r)return chkmax(res.se,dfs(o,l,r,res.fi)),chkmax(res.fi,mx[o]),void();
	int mid=(l+r)>>1;
	if(ql<=mid)query(ls,l,mid,ql,qr,res);
	if(qr>mid)query(rs,mid+1,r,ql,qr,res);
}
void solve(){
	cin>>n>>m>>zsy;
	F(i,1,n)cin>>a[i],sum[i]=sum[i-1]+a[i];
	F(i,1,m)st[i].insert(0);
	F(i,1,n)cin>>c[i],pre[i]=*--st[c[i]].end(),st[c[i]].insert(i);
	build(1,1,n);
	F(_,1,zsy){
		int op,x,y; cin>>op>>x>>y;
		if(!(op&1)){
			if(c[x]==y)continue;
			auto it=st[c[x]].find(x);
			if(next(it)!=st[c[x]].end()){
				int pos=*next(it);
				update(1,1,n,pos,pre[pos]=*prev(it));
			}
			st[c[x]].erase(x),it=st[c[x]=y].lower_bound(x);
			if(it!=st[y].end()){
				int pos=*next(it);
				update(1,1,n,pos,pre[pos]=x);
			}
			update(1,1,n,x,pre[x]=*prev(it)),st[y].insert(x);
		}else{
			node res=mkp(0,0);
			update(1,1,n,x,x-1);
			query(1,1,n,x,y,res);
			update(1,1,n,x,pre[x]);
			cout<<res.se<<endl;
		}
	}
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int zsy=1;
	F(____,1,zsy)solve();
}