rt

#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e6+5;
int n,mod,q,a[maxn],tot;
void add(int x,int y)
{
    if(x>n)
        return;
    // cout<<a[x]<<' '<<tot<<endl;
    tot+=a[x]==0;
    a[x]=(a[x]+y)%mod;
    // cout<<a[x]<<endl;
    tot-=(a[x]==0);
}
int read(){
    int s=0,f=0;
    char ch=getchar();
    while(!isdigit(ch)){
        f|=ch=='-';
        ch=getchar();
    }
    while(isdigit(ch)){
        s=(s<<1)+(s<<3)+(ch^48);
        ch=getchar();
    }
    return f?-s:s;
}
int f[maxn];
signed main()
{   
    // for(int )
    cin>>n>>q>>mod;
    for(signed i=1;i<=n;++i)
        // cin>>a[i];
        a[i]=read();
    f[1]=1;
    for(signed i=2;i<=n;++i)
    {
        f[i]=f[i-1]+f[i-2];
        f[i]%=mod;
    }
    for(signed i=1;i<=n;++i)
    {
        int x;
        cin>>x;
        a[i]-=x;
        a[i]+=mod;
        a[i]%=mod;
    }
    for(signed i=n;i>1;--i)
    {
        a[i]=(a[i]-a[i-1]-a[i-2]+mod+mod)%mod; 
        // cout<<a[i]<<endl;
    }
    for(signed i=1;i<=n;++i)
        tot+=(a[i]>=1);
    for(signed i=1;i<=q;++i)
    {
        char op;
        int x,y;
        cin>>op;
        x=read();
        y=read();
        // cin>>op>>x>>y;
        add(x,((op=='A')?1:-1));
        add(y+1,(f[y-x]+f[y-x+1])*((op=='A')?-1:1));
        add(y+2,f[y-x+1]*((op=='A')?-1:1));
        puts(tot?"NO":"YES");
    }
    return 0;
}