#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=1e9+7,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],op[N],l[N],r[N],k[N],n,m,q,st[20][N];
ll f[N];
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&q);
	for(i=1;i<=n;i++) scanf("%d",&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)]);
	}
	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]);
			A[l[i]]=k[i];
		}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]));
			fill(f,f+k[i],0);for(j=l[i];j<=r[i];j++) f[j%k[i]]+=A[j];//gdb(f[0],f[1]);
			int flag=0;for(j=0;j<k[i];j++) if(f[j]^f[0]){flag=1;break;}
			puts(flag?"No":"Yes");
		}
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}