#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INT __int128
#define UINT __uint128_t
#define ld long double
#define pii pair<int,int>
#define fi first
#define se second
#define pb emplace_back
#define pc __builtin_popcount
#define pcl __builtin_popcountll
#define lb(x) ((x)&-(x))
using namespace std;
void __file(string s){freopen((s+".in").c_str(),"r",stdin),freopen((s+".out").c_str(),"w",stdout);}
const INT P=(ll)(1e18)+3,base=20080523;
INT qpow(INT x,INT y=P-2){INT z=1;while(y){if(y&1)z=z*x%P;x=x*x%P,y>>=1;}return z;}
const ll N=2e5+5,B=150;
ll pw[N],pi[N],pws[N];

struct BIT{
	vector<ll> v;
	int n;
	void init(int siz){n=siz,v.resize(siz+3);}
	inline void upd(int x,ll d){
		for(;x<=n;x+=lb(x)) v[x]+=d;
	}
	inline ll qr(int x){
		ll ans=0;for(;x;x-=lb(x))ans+=v[x];
		return ans;
	}
	inline ll qr(int l,int r){return qr(r)-qr(l-1);}
}s[B+5][B+5],tree;//间隔i，模i余数1~i

inline void add(INT& x,INT y){x+=y;if(x>=P)x-=P;}
inline INT sub(INT x,INT y){add(x,P-y);return x;}
struct BIT_MOD{
	INT v[N];
	int n;
	inline void upd(int x,INT d){
		for(;x<=n;x+=lb(x)) add(v[x],d);
	}
	inline INT qr(int x){
		INT ans=0;for(;x;x-=lb(x)) add(ans,v[x]);
		return ans;
	}
	inline INT qr(int l,int r){return sub(qr(r),qr(l-1));}
}tmod;

ll n,m,q;
ll a[N],b[N];
ll re[N];
namespace OP{
	ll l1[N],r1[N],d[N];
	ll gcd[N];
	void work(int l,int r,vector<int>& v){
		if(l==r){
			for(int i:v) d[i]=b[l];
			return;
		}
		vector<int> lv,rv;
		int mid=(l+r)>>1;
		int i;
		gcd[mid]=b[mid];
		for(i=mid-1;i>=l;i--) gcd[i]=__gcd(gcd[i+1],b[i]);
		gcd[mid+1]=b[mid+1];
		for(i=mid+2;i<=r;i++) gcd[i]=__gcd(gcd[i-1],b[i]);
		for(int i:v){
			if(r1[i]<=mid) lv.pb(i);
			else if(l1[i]>mid) rv.pb(i);
			else{
				d[i]=__gcd(gcd[l1[i]],gcd[r1[i]]);
			}
		}
		work(l,mid,lv),work(mid+1,r,rv);
	}
	ll op[N];
	void init(){
		vector<int> v;for(int i=1;i<=q;i++) if(op[i]==2) v.pb(i);
		work(1,m,v);
		// for(int i=1;i<=q;i++) cerr<<d[i]<<' ';;cerr<<endl;
	}
	ll x[N],y[N];
	ll l[N],r[N];
	void input(){
		char ch;
		for(int i=1;i<=q;i++){
			cin>>ch,op[i]=(ch=='Q')+1;
			if(op[i]==1) cin>>x[i]>>y[i];
			else cin>>l[i]>>r[i]>>l1[i]>>r1[i];
		}
	}
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	ll i,j,x,y;
	cin>>n>>m>>q;
	for(i=1;i<=n;i++) cin>>a[i];
	for(i=1;i<=m;i++) cin>>b[i];
	OP::input(),OP::init();
	INT ib=qpow(base);
	pw[0]=pi[0]=1;for(i=1;i<=n;i++) pw[i]=(INT)pw[i-1]*base%P,pi[i]=(INT)pi[i-1]*ib%P;
	pws[0]=1;for(i=1;i<=n;i++) pws[i]=(pws[i-1]+pw[i])%P;
	tree.init(n);for(i=1;i<=n;i++) tree.upd(i,a[i]);
	tmod.n=n;
	for(i=1;i<=n;i++) tmod.upd(i,(INT)pw[i]*a[i]%P);
	for(i=1;i<=B;i++) for(j=1;j<=i;j++) s[i][j].init(n/i+1);
	for(i=1;i<=B;i++) for(j=1;j<=n;j++){
		s[i][(j-1)%i+1].upd((j-1)/i+1,a[j]);
	}
	for(int Q=1;Q<=q;Q++){
		int op=OP::op[Q];
		if(op==1){
			x=OP::x[Q],y=OP::y[Q];
			INT d=y-a[x];a[x]=y;
			for(i=1;i<=B;i++){
				s[i][(x-1)%i+1].upd((x-1)/i+1,d);
			}
			tree.upd(x,d);
			// cerr<<x<<' '<<(ll)d<<endl;
			d=(d+P)%P*pw[x]%P;
			// cerr<<x<<' '<<(ll)d<<endl;
			tmod.upd(x,d);
		}
		else{
			ll l=OP::l[Q],r=OP::r[Q],d=OP::d[Q];
			d=__gcd(d,r-l+1);
			if(d<=B){
				// cout<<1;
				unordered_set<ll> st;
				ll len=(r-l+1)/d;
				for(i=l;i<l+d;i++){
					st.insert(s[d][(i-1)%d+1].qr((i-1)/d+1,(i-1)/d+len));
					if(st.size()>=2) break;
				}
				cout<<(st.size()==1?"Yes":"No")<<'\n';
			}
			else{
				// cout<<2;
				// cerr<<tree.qr(l,r)<<endl;
				INT u=(tree.qr(l,r)/d%P+P)%P;
				// cerr<<(ll)u<<endl;
				// cout<<l<<' '<<r<<' '<<(ll)d<<' '<<(ll)u<<' '<<endl;
				INT cnt=0,ec=0;
				ec=u*pws[d-1]%P;
				for(i=l;i<=r;i+=d){
					cnt+=tmod.qr(i,i+d-1)*pi[i]%P;
				}
				cnt%=P;
				cout<<(cnt==ec?"Yes":"No")<<'\n';
			}
		}
	}
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<endl;
	return 0;
}