#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5+2,B=448;
const int base=19260817,Mod=1e9+7;

inline int Pow(int x,int y)
{
    int res=1;
    while(y)
    {
        if(y&1) res=1ll*res*x%Mod;
        x=1ll*x*x%Mod,y>>=1;
    }
    return res;
}

int n,m,q,a[Maxn+5],b[Maxn+5],st[Maxn+5][20],pw[Maxn+5];
int L[Maxn+5],R[Maxn+5],idx[Maxn+5],iv[Maxn+5],tot;
inline int Get(int l,int r)
{int len=__lg(r-l+1); return __gcd(st[l][len],st[r-(1<<len)+1][len]);}

struct Block
{
    int sum[B+5],a[Maxn+5];
    inline void Upd(int x,int y)
    {sum[idx[x]]=(1ll*sum[idx[x]]-a[x]+y+Mod)%Mod,a[x]=y;}
    inline int Count(int x)
    {
        if(x==0) return 0;
        int res=0; For(i,1,idx[x]-1) res=(res+sum[i])%Mod;
        For(i,L[idx[x]],x) res=(res+a[i])%Mod; return res;
    }
} T[B+2];

struct Fenwick
{
    int sum[Maxn+5],pr[Maxn+5],a[Maxn+5];
    inline void Upd(int x,int y)
    {
        int dlt=(y-a[x]+Mod)%Mod; a[x]=y;
        For(i,x,R[idx[x]]) pr[i]=(pr[i]+dlt)%Mod;
        For(i,idx[x],tot) sum[i]=(sum[i]+dlt)%Mod;
    }
    inline int Count(int x) {return x==0?0:(sum[idx[x]-1]+pr[x])%Mod;}
} F1,F2;

int main()
{
    // freopen("1.in","r",stdin);

    cin>>n>>m>>q; For(i,1,n) cin>>a[i];
    pw[0]=1; For(i,1,Maxn) pw[i]=1ll*pw[i-1]*base%Mod;
    iv[0]=1; For(i,1,Maxn) iv[i]=Pow(pw[i],Mod-2);
    For(i,1,m) cin>>b[i],st[i][0]=b[i];
    For(j,1,19) for(int i=1;i+(1<<j)-1<=m;++i)
        st[i][j]=__gcd(st[i][j-1],st[i+(1<<j-1)][j-1]);
    for(int i=1;i<=n;i+=B) L[++tot]=i,R[tot]=min(n,i+B-1);
    For(i,1,tot) For(j,L[i],R[i]) idx[j]=i;
    For(i,1,n) For(j,1,B) T[j].Upd(i,1ll*a[i]*pw[i%j]%Mod);
    For(i,1,n) F1.Upd(i,a[i]),F2.Upd(i,1ll*a[i]*pw[i]%Mod);
    int it=0; while(q--)
    {
        char ch; int l,r,x,y; cin>>ch;
        if(ch=='U')
        {
            cin>>x>>y;
            For(i,1,B) T[i].Upd(x,1ll*y*pw[x%i]%Mod);
            F1.Upd(x,y),F2.Upd(x,1ll*y*pw[x]%Mod);
        }
        if(ch=='Q')
        {
            cin>>l>>r>>x>>y; int k=__gcd(Get(x,y),r-l+1);
            int sum=(F1.Count(r)-F1.Count(l-1)+Mod)%Mod;
            sum=1ll*sum*Pow(k,Mod-2)%Mod;
            sum=1ll*sum*(pw[k]-1)%Mod*Pow(base-1,Mod-2)%Mod;
            int all=0;
            if(k<=B) all=(T[k].Count(r)-T[k].Count(l-1)+Mod)%Mod;
            else
            {
                For(i,0,n/k)
                {
                    int a=i*k,b=(i+1)*k-1; a=max(a,l),b=min(b,r);
                    if(a<=b)
                    {
                        int now=(F2.Count(b)-F2.Count(a-1)+Mod)%Mod;
                        all=(all+1ll*now*iv[i*k]%Mod)%Mod;
                    }
                }
            }
            puts(sum==all?"Yes":"No");
        }
    }
    return 0;
}