#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=5e5+5,M=N*4+5,K=63,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m;char c[N];
struct MaT{
	ll A[2][2];
	MaT(){Me(A,0);}
	bool empty(){return A[0][0]==1&&A[1][1]==1&&!A[0][1]&&!A[1][0];}
	MaT operator *(const MaT &B)const{
		int i,j,h;MaT C;
		C.A[0][0]=(A[0][0]*B.A[0][0]+A[0][1]*B.A[1][0])%mod;
		C.A[0][1]=(A[0][0]*B.A[0][1]+A[0][1]*B.A[1][1])%mod;
		C.A[1][0]=(A[1][0]*B.A[0][0]+A[1][1]*B.A[1][0])%mod;
		C.A[1][1]=(A[1][0]*B.A[0][1]+A[1][1]*B.A[1][1])%mod;
		return C;
	}
}W[3],V[3];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
void init(){
	auto inv=[](MaT B){
		MaT C;C.A[0][0]=C.A[1][1]=1;
		ll p=B.A[1][0]*mpow(B.A[0][0])%mod;B.A[1][0]=0;B.A[1][1]=(B.A[1][1]+(mod-p)*B.A[0][1])%mod;C.A[1][0]=(C.A[1][0]+(mod-p)*C.A[0][0])%mod;
		p=B.A[0][1]*mpow(B.A[1][1])%mod;B.A[0][1]=0;C.A[0][1]=(C.A[0][1]+(mod-p)*C.A[1][1])%mod;C.A[0][0]=(C.A[0][0]+(mod-p)*C.A[1][0])%mod;
		for(int i=0;i<2;i++){
			p=mpow(B.A[i][i]);
			for(int j=0;j<2;j++) C.A[i][j]=C.A[i][j]*p%mod;
		}
		return C;
	};
	for(int h=0;h<3;h++){
		for(int i=0;i<2;i++) for(int j=0;j<2;j++) W[h].A[i][j]=(rnd()%mod+mod)%mod;
		V[h]=inv(W[h]);assert((V[h]*W[h]).empty());
	}
}
namespace Tree{
	#define ls v<<1
	#define rs v<<1|1
	MaT S[M][3];int g[M];
	void Up(int v){for(int i=0;i<3;i++) S[v][i]=S[ls][i]*S[rs][i];}
	void PF(int v,int w){
		g[v]=(g[v]+w)%3;
		if(w==1) swap(S[v][0],S[v][1]),swap(S[v][1],S[v][2]);
		if(w==2) swap(S[v][2],S[v][1]),swap(S[v][1],S[v][0]);
	}
	void P(int v){g[v]&&(PF(ls,g[v]),PF(rs,g[v]),g[v]=0);}
	void BD(int l=1,int r=n,int v=1){
		if(l==r){
			for(int i=0;i<3;i++) S[v][i]=(l&1?W[(c[l]-'0'+i)%3]:V[(c[l]-'0'+i)%3]);
			return;
		}
		int m=l+r>>1;BD(l,m,ls);BD(m+1,r,rs);Up(v);
	}
	void Add(int x,int y,int l=1,int r=n,int v=1){
		if(x<=l&&r<=y) return PF(v,1);P(v);int m=l+r>>1;
		x<=m&&(Add(x,y,l,m,ls),0);y>m&&(Add(x,y,m+1,r,rs),0);Up(v);
	}
	MaT qry(int x,int y,int l=1,int r=n,int v=1){
		if(x<=l&&r<=y) return S[v][0];int m=l+r>>1;P(v);
		if(y<=m) return qry(x,y,l,m,ls);if(x>m) return qry(x,y,m+1,r,rs);
		return qry(x,y,l,m,ls)*qry(x,y,m+1,r,rs);
	}
}
int main(){
	init();
	int i,j;scanf("%d%d",&n,&m);scanf("%s",c+1);
	Tree::BD();
	while(m--){
		int op,l,r;scanf("%d%d%d",&op,&l,&r);
		if(op==1) Tree::Add(l,r);
		else puts(Tree::qry(l,r).empty()?"Yes":"No");
	}
}