#include<bits/stdc++.h>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
using namespace std;
mt19937 mt(time(NULL));
constexpr int M=5e5+5,mod=998244353;
int n,q;string str;
struct matrix{ int m00,m01,m10,m11;
    matrix(int m00_=0,int m01_=0,int m10_=0,int m11_=0):m00(m00_),m01(m01_),m10(m10_),m11(m11_){}
    matrix operator*(const matrix &a) const
        {return matrix((1ll*m00*a.m00+1ll*m01*a.m10)%mod,(1ll*m00*a.m01+1ll*m01*a.m11)%mod,
                       (1ll*m10*a.m00+1ll*m11*a.m10)%mod,(1ll*m10*a.m01+1ll*m11*a.m11)%mod);}
    void rand(){m00=mt()%mod;m01=mt()%mod;m10=mt()%mod;m11=mt()%mod;}
    int qpow(int x,int n){
        int s=1; while (n){
            if (n&1) s=1ll*s*x%mod;
            x=1ll*x*x%mod; n>>=1;
        } return s;
    }
    matrix inv(){
        int det=qpow((1ll*m00*m11+1ll*(mod-m01)*m10)%mod,mod-2);
        return matrix(1ll*m11*det%mod,1ll*(mod-m01)*det%mod,1ll*(mod-m10)*det%mod,1ll*m00*det%mod);
    }
}R[2][3],tmp[3],ans;
struct segtree{matrix mat[3];int lazy;}tr[M<<2];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void pushup(int x){
    for (auto k:{0,1,2}) tr[x].mat[k]=tr[ls(x)].mat[k]*tr[rs(x)].mat[k];
}
void build(int l,int r,int x){
    if (l==r){
        for (auto k:{0,1,2})
            tr[x].mat[k]=R[l&1][(str[l]+k)%3];
        return;
    } int mid=l+r>>1;
    build(l,mid,ls(x));build(mid+1,r,rs(x));
    pushup(x);
}
void addtag(int x,int p){
    for (auto k:{0,1,2}) tmp[k]=tr[x].mat[(k+p)%3];
    for (auto k:{0,1,2}) tr[x].mat[k]=tmp[k];
    tr[x].lazy=(tr[x].lazy+p)%3;
}
void pushdown(int x){if (tr[x].lazy) addtag(ls(x),tr[x].lazy),addtag(rs(x),tr[x].lazy),tr[x].lazy=0;}
void update(int L,int R,int l=1,int r=n,int x=1){
    if (L<=l&&r<=R) return addtag(x,1);
    int mid=l+r>>1; pushdown(x);
    if (L<=mid) update(L,R,l,mid,ls(x));
    if (R>mid) update(L,R,mid+1,r,rs(x));
    pushup(x);
}
void query(int L,int R,int l=1,int r=n,int x=1){
    if (L<=l&&r<=R) return ans=ans*tr[x].mat[0],void();
    int mid=l+r>>1; pushdown(x);
    if (L<=mid) query(L,R,l,mid,ls(x));
    if (R>mid) query(L,R,mid+1,r,rs(x));
}
int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n>>q>>str;str=" "+str;
    for (auto k:{0,1,2})
        R[0][k].rand(),R[1][k]=R[0][k].inv();
    build(1,n,1); while (q--){
        int op,l,r;cin>>op>>l>>r;
        if (op==1) update(l,r,1);
        if (op==2){
            ans=matrix(1,0,0,1); query(l,r);
            puts(ans.m00==1&&!ans.m01&&!ans.m10&&ans.m11==1?"Yes":"No");
        }
    }
    return 0;
}