#pragma GCC optimize("Ofast","inline")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=3e5+50,mod=1e9+7,S=150;

mt19937 rad(time(0));

int n,m,q,st[N][20],a[N],b[N],lg[N],x=rad()%mod,fir[N],mi[N],bl[N],imi[N],ix,sum[N],t[N/S+50][S+50];

int ksm(int a,int b)
{
    int ans=1;
    while(b)
    {
        if(b&1)ans=ans*a%mod;
        b>>=1;a=a*a%mod;
    }
    return ans;
}

int find(int l,int r)
{
    int k=lg[r-l+1];
    return __gcd(st[l][k],st[r-(1<<k)+1][k]);
}

void ad(int&x,int y)
{
    x+=y;
    x-=x>=mod?mod:0;
}

struct block
{
    int sum[N/S+50],k,val[N/S+50];

    void change(int x,int ad)
    {
        sum[bl[x]]=(sum[bl[x]]+ad*mi[x%k]%mod)%mod;
        if(x%k==0)val[bl[x]]=(val[bl[x]]+ad)%mod;
    }

    void init()
    {
        for(int i=1;i<=n;i++)change(i,a[i]);
    }

    int w(int x)
    {
        return a[x]*mi[x%k]%mod;
    }

    int find(int l,int r)
    {
        int ans=0;
        for(int i=l;i<=min(bl[l]*S,r);i++)ad(ans,w(i));
        if(r<=bl[l]*S)return ans;
        for(int i=bl[l]+1;i<bl[r];i++)ad(ans,sum[i]);
        for(int i=r;i>(bl[r]-1)*S;i--)ad(ans,w(i));
        return ans;
    }

    int finds(int l,int r)
    {
        int ans=0;
        for(int i=l;i<=min(bl[l]*S,r);i++)if(i%k==0)ad(ans,w(i));
        if(r<=bl[l]*S)return ans;
        for(int i=bl[l]+1;i<bl[r];i++)ad(ans,val[i]);
        for(int i=r;i>(bl[r]-1)*S;i--)if(i%k==0)ad(ans,w(i));
        return ans;
    }
}B[S+50];

void rebuild(int p)
{
    int l=(p-1)*S+1,r=min(n,p*S);sum[p]=0;
    for(int i=l;i<=r;i++)t[p][i-l+1]=(t[p][i-l]+a[i]*mi[i]%mod)%mod,ad(sum[p],a[i]*mi[i]%mod);
}

int findsum(int l,int r)
{
    int p=bl[l],L=(p-1)*S+1,LL=(bl[r]-1)*S+1;
    if(bl[l]==bl[r])return (t[p][r-L+1]-t[p][l-L]+mod)%mod;
    int ans=0;
    ad(ans,(t[p][S]-t[p][l-L]+mod)%mod);
    ad(ans,t[bl[r]][r-LL+1]);
    for(int i=bl[l]+1;i<bl[r];i++)ad(ans,sum[i]);
    return ans;
}

namespace IO {
#define iL (1 << 20)
char ibuf[iL], *iS = ibuf + iL, *iT = ibuf + iL;
#define gc() ((iS == iT) ? (iT = (iS = ibuf) + fread(ibuf, 1, iL, stdin), iS == iT ? EOF : *iS ++) : *iS ++)
template<class T> inline void read(T &x) {
  x = 0;int f = 0;char ch = gc();
  for (; !isdigit(ch); f |= ch == '-', ch = gc());
  for (; isdigit(ch); x = (x << 1) + (x << 3) + (ch ^ 48), ch = gc());
  x = (f == 1 ? ~ x + 1 : x);
}
template<class T, class... Args> inline void read(T &x, Args&... args) { read(x), read(args...); }
template<class T> inline void readch(T &x) { char ch = gc(); for (; !isalpha(ch); ch = gc()); x = ch; }
char Out[iL], *iter = Out;
#define flush() fwrite(Out, 1, iter - Out, stdout), iter = Out
template<class T> inline void write(T x, char ch = '\n') {
  T l, c[35];
  if (x < 0) *iter ++ = '-', x = ~ x + 1;
  for (l = 0; !l || x; c[l] = x % 10, l++, x /= 10);
  for (; l; -- l, *iter ++ = c[l] + '0');*iter ++ = ch;
  flush();
}
template<class T, class... Args> inline void write(T x, Args... args) { write(x, ' '), write(args...); }
} // IO
using namespace IO;

signed main()
{
    // freopen("root10.in","r",stdin);
    // freopen("root.out","w",stdout);
    read(n,m,q);lg[0]=-1;mi[0]=fir[0]=imi[0]=1;ix=ksm(x,mod-2);
    for(int i=1;i<=n;i++)read(a[i]),mi[i]=mi[i-1]*x%mod,fir[i]=(fir[i-1]+mi[i])%mod,imi[i]=imi[i-1]*ix%mod;
    for(int i=1;i<=m;i++)read(b[i]),st[i][0]=b[i],lg[i]=lg[i>>1]+1;
    for(int i=1;(1<<i)<=m;i++)for(int j=1;j+(1<<i)-1<=m;j++)st[j][i]=__gcd(st[j][i-1],st[j+(1<<i-1)][i-1]);
    for(int i=1;i<=n;i++)bl[i]=(i-1)/S+1;
    for(int i=1;i<=S;i++)B[i].k=i,B[i].init(),rebuild(i);
    int cc=0;
    while(q--)
    {
        char z;readch(z);
        if(z=='U')
        {
            int pos,x;read(pos,x);
            for(int i=1;i<=S;i++)B[i].change(pos,(mod+x-a[pos])%mod);
            a[pos]=x;rebuild(bl[pos]);
            continue;
        }
        int l1,l2,r1,r2;read(l1,r1,l2,r2);
        cc++;
        int k=__gcd(r1-l1+1,find(l2,r2));
        if(k<=S)
        {
            if(B[k].find(l1,r1)==B[k].finds(l1,r1)*fir[k-1]%mod)puts("Yes");
            else puts("No");
            continue;
        }
        int sa=0,sb=0;
        for(int t=1;(t-1)*k<=n;t++)
        {
            int l=max(l1,(t-1)*k),r=min(r1,t*k-1);
            if(l<=r)
            {
                ad(sa,findsum(l,r)*imi[(t-1)*k]%mod);
                if(l==(t-1)*k)ad(sb,a[l]);
            }
        }
        if(sa==sb*fir[k-1]%mod)puts("Yes");
        else puts("No");
    }
}