#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,m,k;
struct mat{
	modint a[2][2];
	modint*operator[](int x){return a[x];}
	mat(modint A=0,modint B=0,modint C=0,modint D=0){a[0][0]=A,a[0][1]=B,a[1][0]=C,a[1][1]=D;}
	mat operator *(mat b)const{
		return mat(
			a[0][0]*b[0][0]+a[0][1]*b[1][0],
			a[0][0]*b[0][1]+a[0][1]*b[1][1],
			a[1][0]*b[0][0]+a[1][1]*b[1][0],
			a[1][0]*b[0][1]+a[1][1]*b[1][1] 
		);
	}
};

mt19937_64 rnd(198964);
int a[maxn];
mat val[5],fval[5];

mat gen(){
	mat a;
	For(i,0,1)For(j,0,1)a[i][j]=rnd()%(mod-1)+1;
	return a;
}
int pi[505],pj[505];
bool getinv(mat&a){
	mat tmp=a;
	For(k,0,1){
		For(i,k,1)
			For(j,k,1)
				if(a[i][j].x){pi[k]=i,pj[k]=j;break;}
		For(i,0,1)swap(a[k][i],a[pi[k]][i]);
		For(i,0,1)swap(a[i][k],a[i][pj[k]]);
		if(!a[k][k].x)return 0;
		a[k][k]=1/a[k][k];
		For(j,0,1)if(j!=k)a[k][j]*=a[k][k];
		For(i,0,1)if(i!=k)For(j,0,1)if(j!=k)a[i][j]-=a[i][k]*a[k][j];
		For(i,0,1)if(i!=k)a[i][k]=-a[i][k]*a[k][k];
	}
	Rep(k,1,0){
		For(i,0,1)swap(a[pj[k]][i],a[k][i]);
		For(i,0,1)swap(a[i][pi[k]],a[i][k]);
	}
	tmp=tmp*a;
	return 1;
}

mat tr[maxn<<2][3],tmp[3];
int tag[maxn<<2];
void up(int p){
	For(i,0,2)
		tr[p][i]=tr[p<<1][i]*tr[p<<1|1][i];
}
void build(int p,int l,int r){
	if(l==r){
		For(i,0,2){
			if(l%2)tr[p][i]=val[(a[l]+i)%3];
			else tr[p][i]=fval[(a[l]+i)%3];
		}
		return;
	}
	int mid=l+r>>1;
	build(p<<1,l,mid),build(p<<1|1,mid+1,r),up(p);
}
void pt(int p,int v){
	if(!v)return;
	tag[p]=(tag[p]+v)%3;
	For(i,0,2)tmp[i]=tr[p][(i+v)%3];
	For(i,0,2)tr[p][i]=tmp[i];
}
void down(int p){
	if(tag[p]){
		pt(p<<1,tag[p]),pt(p<<1|1,tag[p]);
		tag[p]=0;
	}
}
void mdf(int p,int l,int r,int nl,int nr){
	if(l>=nl&&r<=nr)return pt(p,1);
	int mid=l+r>>1; down(p);
	if(nl<=mid)mdf(p<<1,l,mid,nl,nr);
	if(nr>mid)mdf(p<<1|1,mid+1,r,nl,nr);
	up(p);
}
mat ask(int p,int l,int r,int ql,int qr){
	if(l>=ql&&r<=qr)return tr[p][0];
	int mid=l+r>>1; down(p);
	if(ql>mid)return ask(p<<1|1,mid+1,r,ql,qr);
	if(qr<=mid)return ask(p<<1,l,mid,ql,qr);
	return ask(p<<1,l,mid,ql,qr)*ask(p<<1|1,mid+1,r,ql,qr);
}

signed main()
{
	n=read(),m=read();
	string A; cin>>A; 
	For(i,1,n)a[i]=A[i-1]&3;
	For(i,0,2){
		val[i]=gen(); fval[i]=val[i];
		while(!getinv(fval[i]))val[i]=fval[i]=gen();
	//	mat res=(val[i]*fval[i]);
	}
	build(1,1,n);
	mat I;
	I[0][0]=I[1][1]=1;
	For(_,1,m){
		int op=read(),l=read(),r=read();
		if(op==1)mdf(1,1,n,l,r);
		else{
			mat res=ask(1,1,n,l,r);
		//	For(i,0,1)For(j,0,1)cout<<res[i][j].x<<" \n"[j]; 
			bool ok=1;
			For(i,0,1)For(j,0,1)if(res[i][j].x!=(i==j))ok=0;
			puts(ok?"Yes":"No");
		}
	}
	return 0;
}