#include<cstdio>
#include<algorithm>
using namespace std;
const int N=2e5+5;
int n,m,Q,a[N],c[N],cnt,tm[N<<2],tl[N<<5],ls[N<<5],rs[N<<5],rt[N];
struct node{int bz,cl,cr,sl,sr,sum,ans;}t[N<<2];
node comb(node l,node r)
{
	node res;
	res.sum=l.sum+r.sum;
	res.ans=max(l.ans,r.ans);
	if(l.cr!=r.cl)
	{
		res.ans=max(res.ans,l.sr+r.sl);
		if(l.bz&&r.bz)res.bz=1;
	}
	res.cl=l.cl;
	res.cr=r.cr;
	res.sl=l.sl;
	res.sr=r.sr;
	if(l.bz&&l.cr!=r.cl)res.sl=max(res.sl,l.sl+r.sl);
	if(r.bz&&l.cr!=r.cl)res.sr=max(res.sr,r.sr+l.sr);
	return res;
}
void build(int v,int l,int r)
{
	if(l==r)
	{
		t[v]=(node){1,c[l],c[l],a[l],a[l],a[l],a[l]};
		return;
	}
	int mid=l+r>>1;
	build(v<<1,l,mid);
	build(v<<1|1,mid+1,r);
	t[v]=comb(t[v<<1],t[v<<1|1]);
}
void upt(int v,int l,int r,int x,int y)
{
	if(l==r)
	{
		t[v].cl=t[v].cr=y;
		return;
	}
	int mid=l+r>>1;
	if(x<=mid)upt(v<<1,l,mid,x,y);
	else upt(v<<1|1,mid+1,r,x,y);
	t[v]=comb(t[v<<1],t[v<<1|1]);
}
node que(int v,int l,int r,int x,int y)
{
	if(l>=x&&r<=y)return t[v];
	int mid=l+r>>1;
	if(y<=mid)return que(v<<1,l,mid,x,y);
	if(x>mid)return que(v<<1|1,mid+1,r,x,y);
	node resl=que(v<<1,l,mid,x,y),resr=que(v<<1|1,mid+1,r,x,y);
	return comb(resl,resr);
}
void chg(int v,int l,int r,int x,int y)
{
	if(l==r)
	{
		tm[v]=y;
		return;
	}
	int mid=l+r>>1;
	if(x<=mid)chg(v<<1,l,mid,x,y);
	else chg(v<<1|1,mid+1,r,x,y);
	tm[v]=max(tm[v<<1],tm[v<<1|1]);
}
int ask(int v,int l,int r,int x,int y)
{
	if(l>=x&&r<=y)return tm[v];
	int mid=l+r>>1,res=0;
	if(x<=mid)res=max(res,ask(v<<1,l,mid,x,y));
	if(mid<y)res=max(res,ask(v<<1|1,mid+1,r,x,y));
	return res;
}
void ins(int &v,int l,int r,int x,int y)
{
	if(!v)v=++cnt;
	if(l==r)
	{
		if(y)tl[v]=x;
		else tl[v]=n+1;
		return;
	}
	int mid=l+r>>1;
	if(x<=mid)ins(ls[v],l,mid,x,y);
	else ins(rs[v],mid+1,r,x,y);
	tl[v]=min(tl[ls[v]],tl[rs[v]]);
}
int find(int v,int l,int r,int x)
{
	if(!v)return 0;
	if(tl[v]>n)return 0;
	int mid=l+r>>1;
	if(x<=mid)return find(ls[v],l,mid,x);
	if(tl[rs[v]]<=x)return find(rs[v],mid+1,r,x);
	return find(ls[v],l,mid,x);
}
int main()
{
	scanf("%d%d%d",&n,&m,&Q);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)scanf("%d",&c[i]);
	build(1,1,n);
	tl[0]=n+1;
	for(int i=1;i<=n;i++)
	{
		ins(rt[c[i]],1,n,i,1);
		int x=find(rt[c[i]],1,n,i-1);
		node y=que(1,1,n,x+1,i);
		chg(1,1,n,i,y.sum);
	}
	for(;Q;Q--)
	{
		int op,x,y;
		scanf("%d%d%d",&op,&x,&y);
		if(op==1)
		{
			node s=que(1,1,n,x,y);
			int mi=ask(1,1,n,x,y);
			printf("%d\n",min(s.ans,mi));
		}
		else
		{
			upt(1,1,n,x,y);
			ins(rt[c[x]],1,n,x,0);
			c[x]=y;
			ins(rt[c[x]],1,n,x,1);
			int l=find(rt[c[x]],1,n,x-1);
			node r=que(1,1,n,l+1,x);
			chg(1,1,n,x,r.sum);
		}
	}
	return 0;
}