#include <iostream>
#include <set>
using namespace std ;

int read ( ) {
	char ch = getchar ( ) ;
	int x = 0 ;
	while ( ch < '0' || ch > '9' )
		ch = getchar ( ) ;
	while ( ch >= '0' && ch <= '9' )
		x = x * 10 + ch - 48 , ch = getchar ( ) ;
	return x ;
}

const int N = 200005 ;
int n , m , q , a[N] , c[N] , vis[N] , suf[N] ;
int mif[N<<2] , ts[N<<2] , tls[N<<2] ;

set < int > st[N] ;

int find ( int k , int l , int r , int lim ) {
	if ( l == r )
		return a [ lim - 1 ] - a [ l ] ;
	int mid = ( l + r ) >> 1 ;
	if ( mif [ k << 1 | 1 ] > lim )
		return find ( k << 1 , l , mid , lim ) ;
	return max ( tls [ k ] , find ( k << 1 | 1 , mid + 1 , r , lim ) ) ;
}

void pushup ( int k , int l , int r ) {
	int ls = k << 1 , rs = k << 1 | 1 ;
	if ( mif [ ls ] > mif [ rs ] ) {
		ts [ k ] = ts [ rs ] ;
		tls [ k ] = 0 ;
		mif [ k ] = mif [ rs ] ;
	}
	else {
		int mid = ( l + r ) >> 1 ;
		tls [ k ] = find ( ls , l , mid , mif [ rs ] ) ;
		ts [ k ] = max ( tls [ k ] , ts [ rs ] ) ;
		mif [ k ] = mif [ ls ] ;
	}
}

void build ( int k , int l , int r ) {
	if ( l == r ) {
		mif [ k ] = suf [ l ] ;
		ts [ k ] = 0 ;
		return ;
	}
	int mid = ( l + r ) >> 1 ;
	build ( k << 1 , l , mid ) ;
	build ( k << 1 | 1 , mid + 1 , r ) ;
	pushup ( k , l , r ) ;
}

void change ( int k , int l , int r , int x , int y ) {
	if ( l == r ) {
		mif [ k ] = y ;
		ts [ k ] = 0 ;
		return ;
	}
	int mid = ( l + r ) >> 1 ;
	if ( x <= mid ) change ( k << 1 , l , mid , x , y ) ;
	else change ( k << 1 | 1 , mid + 1 , r , x , y ) ;
	pushup ( k , l , r ) ;
}

int lm ;
int query ( int k , int l , int r , int x , int y ) {
	if ( x <= l && r <= y ) {
		if ( mif [ k ] > lm ) return 0 ;
		int tmp = find ( k , l , r , lm ) ; lm = min ( lm , mif [ k ] ) ;
		return tmp ;
	}
	int mid = ( l + r ) >> 1 ;
	if ( x > mid ) return query ( k << 1 | 1 , mid + 1 , r , x , y ) ;
	if ( y <= mid ) return query ( k << 1 , l , mid , x , y ) ;
	int tmp1 = query ( k << 1 | 1 , mid + 1 , r , x , y ) ;
	int tmp2 = query ( k << 1 , l , mid , x , y ) ;
	return min ( tmp1 , tmp2 ) ;
}

#define IT set<int>::iterator

int main ( ) {
	n = read ( ) , m = read ( ) , q = read ( ) ;
	for ( int i = 1 ; i <= n ; ++ i )
		a [ i ] = read ( ) + a [ i - 1 ] ;
	for ( int i = 1 ; i <= n ; ++ i )
		c [ i ] = read ( ) ;
	for ( int i = 1 ; i <= m ; ++ i )
		vis [ i ] = n + 1 , st [ i ] .insert ( n + 1 ) ;
	for ( int i = n ; i ; -- i ) {
		suf [ i ] = vis [ c [ i ] ] ;
		vis [ c [ i ] ] = i ;
		st [ c [ i ] ] .insert ( i ) ;
	}
	build ( 1 , 1 , n ) ;
	while ( q -- ) {
		int op = read ( ) , x = read ( ) , y = read ( ) ;
		if ( op == 1 ) {
			lm = y + 1 ;
			cout << query ( 1 , 1 , n , x , y ) << "\n" ;
		}
		else {
			IT it = st [ c [ x ] ] .lower_bound ( x ) , jt = it ; ++ jt ;
			if ( it != st [ c [ x ] ] .begin ( ) )
				change ( 1 , 1 , n , *it , *jt ) , suf [ *it ] = *jt ;
			
			jt = st [ y ] .lower_bound ( x ) , it = jt ;
			change ( 1 , 1 , n , x , *jt ) ;
			suf [ x ] = *jt ;
			if ( ! st [ y ] .empty ( ) && it != st [ y ] .begin ( ) ) {
				-- it ;
				change ( 1 , 1 , n , *it , x ) ;
				suf [ *it ] = x ;
			}
		}
	}
	return 0 ;
}