#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
    int len=0;
    char ibuf[(1<<21)+1],*iS,*iT,out[(1<<26)+1];
    #if ONLINE_JUDGE
    #define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
    #else
    #define gh() getchar()
    #endif
    #define reg register
    inline int read(){
        reg char ch=gh();
        reg int x=0;
        reg char t=0;
        while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
        while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
        return t?-x:x;
    }
    inline void putc(char ch){
        out[len++]=ch;
    }
    template<class T>
    inline void write(T x){
        if(x<0)putc('-'),x=-x;
        if(x>9)write(x/10);
        out[len++]=x%10+48;
    }
    inline void flush(){
        fwrite(out,1,len,stdout);
        len=0;
    }
    inline char getc(){
        char ch=gh();
        while(ch<'0'||ch>'2') ch=gh();
        return ch;
    }
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
namespace rad{
	mt19937_64 R(chrono::system_clock::now().time_since_epoch().count());
	inline int Rand(int l,int r){
		uniform_int_distribution<int> distribution(l,r);
		return distribution(R);
	}
}
using namespace rad;
const int N=5e5+10,mod=1e9+7;
inline int add(int a,int b){ return a+b>=mod?a+b-mod:a+b; }
inline int dec(int a,int b){ return a>=b?a-b:a+mod-b; }
inline void inc(int &a,int b){ a=a+b>=mod?a+b-mod:a+b; }
inline int qpow(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;
}
struct Matrix{
	int a[2][2];
	int n,m;
	inline void init(int N,int M){
		n=N,m=M;
		for(int i=0;i<n;i++)
			for(int j=0;j<m;j++)
				a[i][j]=0;
	}
	inline int* operator[](int x){ return a[x]; }
	inline friend Matrix operator*(Matrix a,Matrix b){
		Matrix c;
		c.init(a.n,b.m);
		for(int k=0;k<a.m;k++)
			for(int i=0;i<c.n;i++)
				for(int j=0;j<b.m;j++)
					inc(c[i][j],1ll*a[i][k]*b[k][j]%mod);
		return c;
	}
	inline bool chk(){
		for(int i=0;i<n;i++)
			for(int j=0;j<m;j++)
				if(a[i][j]!=(i==j))
					return 0;
		return 1;
	}
}M[3];
int n,q,a[N];
struct Segment_Tree{
	#define ls (rt<<1)
	#define rs (rt<<1|1)
	Matrix res[N<<2][3];
	int tag[N<<2];
	inline void pushup(int rt){
		res[rt][0]=res[ls][0]*res[rs][0];
		res[rt][1]=res[ls][1]*res[rs][1];
		res[rt][2]=res[ls][2]*res[rs][2];
	}
	inline void pushtag(int rt,int v){
		Matrix tp[3];
		tag[rt]+=v;
		for(int i=0;i<3;i++) tp[i]=res[rt][(i+v)%3];
		for(int i=0;i<3;i++) res[rt][i]=tp[i];
	}
	inline void pushdown(int rt){
		if(!tag[rt]) return ;
		pushtag(ls,tag[rt]),pushtag(rs,tag[rt]);
		tag[rt]=0;
	}
	inline void build(int rt,int l,int r){
		if(l==r){
			for(int i=0;i<3;i++)
				res[rt][i]=M[(i+a[l])%3];
			return ;
		}
		int mid=l+r>>1;
		build(ls,l,mid),build(rs,mid+1,r);
		pushup(rt);
	}
	inline void add(int rt,int l,int r,int L,int R){
		if(L<=l&&r<=R) return pushtag(rt,1);
		pushdown(rt);
		int mid=l+r>>1;
		if(L<=mid) add(ls,l,mid,L,R);
		if(R>mid) add(rs,mid+1,r,L,R);
		pushup(rt);
	}
	inline Matrix query(int rt,int l,int r,int L,int R){
		if(L<=l&&r<=R) return res[rt][0];
		pushdown(rt);
		int mid=l+r>>1;
		if(R<=mid) return query(ls,l,mid,L,R);
		if(L>mid) return query(rs,mid+1,r,L,R);
		return query(ls,l,mid,L,R)*query(rs,mid+1,r,L,R);
	}
}T;
int main(){
//	freopen("ex_xiao2.in","r",stdin);
//	freopen("ex_xiao2.ans","w",stdout);
	n=read(),q=read();
	for(int i=1;i<=n;i++)
		a[i]=getc()-'0';
	for(int i=0;i<=2;i++){
		int a=Rand(1,mod-1),b=Rand(1,mod-1);
		Matrix A;
		A.init(2,2);
		A[0][0]=a,A[0][1]=b,A[1][0]=1,A[1][1]=1;
		A[1][0]=1ll*dec(1,1ll*a*a%mod)*qpow(b,mod-2)%mod,A[1][1]=dec(0,a);
		M[i]=A;
	}
	T.build(1,1,n);
	while(q--){
		int op=read(),l=read(),r=read();
		if(op==1) T.add(1,1,n,l,r);
		else puts(T.query(1,1,n,l,r).chk()?"Yes":"No");
	}
	flush();
}