#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=N*50+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=2e18+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int A[N],B[N],op[N],l[N],r[N],k[N],n,m,q,st[20][N],ans[N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
ll goal[N];
namespace bit{
	ll f[N];void add(int x,int w){while(x<=n) f[x]+=w,x+=x&-x;}
	ll qry(int x){ll ans=0;while(x) ans+=f[x],x-=x&-x;return ans;}
}
ll pw[N],iw[N];const int bas=137;
const int ivb=mpow(bas-1);
namespace Block1{
	ll f[N],g[N];int BB;
	void build(){
		BB=sqrt(n);
		for(int i=0;i<=n/BB;i++){
			int fr=max(1,i*BB),en=min(n,i*BB+BB-1);
			for(int i=fr;i<=en;i++) f[i]=A[i]*pw[i]%mod;
			for(int i=fr+1;i<=en;i++) f[i]+=f[i-1];
			g[i]=f[en];if(i) g[i]+=g[i-1];
		}
	}
	void add(int x,ll w){
		int X=x/BB;
		for(int i=X;i<=n/BB;i++) g[i]+=w;
		for(int i=x;i<=X*BB+BB-1&&i<=n;i++) f[i]+=w;
	}
	ll qry(int x){
		return f[x]+(x/BB?g[x/BB-1]:0);
	}
}
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&q);
	for(i=1;i<=n;i++) scanf("%d",&A[i]),bit::add(i,A[i]);
	for(i=1;i<=m;i++) scanf("%d",&st[0][i]);
	for(i=1;(1<<i)<=m;i++){
		for(j=1;j+(1<<i)-1<=m;j++) st[i][j]=__gcd(st[i-1][j],st[i-1][j+(1<<i-1)]);
	}
	Mc(B,A);
	for(pw[0]=i=1;i<=n;i++) pw[i]=pw[i-1]*bas%mod;
	iw[0]=1;iw[1]=mpow(bas);for(i=2;i<=n;i++) iw[i]=iw[i-1]*iw[1]%mod;
	Block1::build();
	for(i=1;i<=q;i++){
		char c=Gc();while(c<'A'||c>'Z') c=Gc();
		if(c=='U'){
			op[i]=1;
			scanf("%d%d",&l[i],&k[i]);
			bit::add(l[i],-A[l[i]]);Block1::add(l[i],-A[l[i]]*pw[l[i]]%mod);
			A[l[i]]=k[i];
			bit::add(l[i],A[l[i]]);Block1::add(l[i],A[l[i]]*pw[l[i]]%mod);
		}else{
			int x,y;op[i]=2;scanf("%d%d%d%d",&l[i],&r[i],&x,&y);
			int d=__lg(y-x+1);k[i]=__gcd(r[i]-l[i]+1,__gcd(st[d][x],st[d][y-(1<<d)+1]));
			ll sum=bit::qry(r[i])-bit::qry(l[i]-1);
			if(sum%k[i]){ans[i]=2;continue;}
			goal[i]=sum/k[i]%mod*(pw[k[i]]-1)%mod*ivb%mod;
			ll tot=0;for(j=l[i];j<=r[i];j+=k[i]) tot+=(Block1::qry(j+k[i]-1)-Block1::qry(j-1))%mod*iw[j]%mod;
			gdb(i,sum,k[i],goal[i],tot%mod);
			ans[i]=(tot%mod==goal[i]?1:2);
		}
	}
	for(i=1;i<=q;i++) if(op[i]==2) puts(ans[i]^2?"Yes":"No");
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}