#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=2e5+10,B=400,mod=1e9+9,base=23333333,Maxb=460;
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }
    return sum;
}
int n,q;
namespace GCD{
    int lg[Maxn];
    inline int gcd(int x,int y){
        if(y==0) return x;
        return gcd(y,x%y);
    }
    int ln;
    int a[Maxn],f[Maxn][21];
    inline void init(){
        lg[0]=-1;
        fr(i,1,ln) lg[i]=lg[i/2]+1;
        fr(i,1,ln) f[i][0]=a[i];
        fr(j,1,lg[ln]) fr(i,1,ln){
            if(i+(1<<j)-1>ln) break;
            f[i][j]=gcd(f[i][j-1],f[i+(1<<(j-1))][j-1]);
        }
    }
    inline int getgcd(int l,int r){
        int ln=lg[r-l+1];
        return gcd(f[l][ln],f[r-(1<<ln)+1][ln]);
    }
}
inline void add(int &x,int y){
    x=1ll*(x+y)%mod;
}
namespace bit{
    int s[Maxn];
    inline int lowbit(int x){return x&(-x);}
    inline void update(int x,int k){
        while(x<=n) s[x]=(s[x]+k)%mod,x+=lowbit(x);
    }
    inline int query(int x){
        int ans=0;
        while(x) add(ans,s[x]),x-=lowbit(x);
        return ans;
    }
    inline int getans(int l,int r){
        return (query(r)-query(l-1)+mod)%mod;
    }
}
int a[Maxn];
int id[Maxn];
int bl[Maxn],br[Maxn];
int nod;
namespace ALL{
    int pre[Maxn],s[Maxn];
    int a[Maxn];
    inline void update(int x,int k){
        int now=(k-a[x]+mod)%mod;
        fr(i,id[x],nod) add(s[i],now);
        fr(i,x,br[id[x]]) add(pre[i],now);
        a[x]=k;
    }
    inline int query(int x){
        if(x<=0) return 0;
        return (s[id[x]-1]+pre[x])%mod;
    }
}
struct BLOCK{
    int s[Maxn];
    int S[Maxb];
    inline void update(int x,int k){
        // cout<<x<<' '<<a[x]<<' '<<k<<endl;
        S[id[x]]=1ll*(0ll+S[id[x]]-s[x]+k+mod)%mod;
        s[x]=k%mod;
        // assert(S[id[x]]>)
    }
    inline int query(int x){
        int ans=0;
        if(x==0) return 0;
        fr(i,1,id[x]-1){
            add(ans,S[i]);
            // assert(S[i]<mod);
        }
        fr(i,bl[id[x]],x) add(ans,s[i]);
        // assert(ans<mod);
        return ans;
    }
}block[Maxn/B];
int ipw[Maxn];
int s[Maxn];
int pw[Maxn];
inline void init(){
    n=read();GCD::ln=read();q=read();
    fr(i,1,n) a[i]=read();
    fr(i,1,GCD::ln) GCD::a[i]=read();
    GCD::init();
    fr(i,1,n){
        id[i]=(i-1)/B+1;
        if(!bl[id[i]]) bl[id[i]]=i;
        br[id[i]]=i;
    }
    pw[0]=ipw[0]=1;s[0]=1;
    fr(i,1,n) pw[i]=1ll*pw[i-1]*base%mod,ipw[i]=ksm(pw[i]);
    fr(i,1,n) s[i]=pw[i],add(s[i],s[i-1]);
    nod=id[n];
    // cerr<<nod<<endl;
    fr(i,1,B) fr(j,1,n) block[i].update(j,1ll*pw[j%i]*a[j]%mod);
    fr(i,1,n) bit::update(i,a[i]);
    fr(i,1,n) ALL::update(i,1ll*pw[i]*a[i]%mod);
}
char ch[2];
inline void work(){
    int Q;Q=0;
    while(q--){
        scanf("%s",ch+1);
        if(ch[1]=='U'){
            int x,k;
            x=read();k=read();
            bit::update(x,(k-a[x]+mod)%mod);
            fr(i,1,B) block[i].update(x,1ll*pw[x%i]*k%mod);
            ALL::update(x,1ll*pw[x]*k%mod);a[x]=k;
        }
        else {
            int l,r,ll,rr;
            l=read();r=read();ll=read();rr=read();
            int k=GCD::getgcd(ll,rr);k=GCD::gcd(k,(r-l+1));
            // cout<<l<<' '<<r<<' '<<k<<endl;
            int s1;s1=1ll*bit::getans(l,r)*ksm(k)%mod*s[k-1]%mod;
            int s2=0;
            // cout<<s1<<endl;
            ++Q;
            if(k<=B){
                // cout<<block[k].query(r)<<' '<<block[k].query(l-1)<<endl;
                s2=(block[k].query(r)-block[k].query(l-1)+mod)%mod;
            }
            else {
                fr(i,0,n/k){
                    int nowl,nowr;
                    nowl=i*k,nowr=(i+1)*k-1;
                    nowl=max(nowl,l);nowr=min(nowr,r);
                    if(nowl>nowr) continue;
                    // if(Q==4909) cout<<i<<' '<<s2<<endl;
                    int now;now=(ALL::query(nowr)-ALL::query(nowl-1)+mod)%mod;
                    add(s2,1ll*now*ipw[i*k]%mod);
                }
                // if(n==Q && n==200000) cout<<"**"<<endl;
            }
            // cout<<k<<' '<<s1<<' '<<s2<<endl;
            s1=(s1+mod)%mod;s2=(s2+mod)%mod;
            // if(Q==4909) cout<<l<<' '<<r<<' '<<ll<<' '<<rr<<endl;
            if(s1==s2) puts("Yes");
            else puts("No");
        }
    }
    // fr(i,1,n) cout<<a[i]<<' ';cout<<endl;
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}