#include<bits/stdc++.h>
#define int long long
#define ul unsigned long long
#define ui unsigned int
#define db double
#define ld long double
#define bg begin()
#define ed end()
#define pb emplace_back
#define clr clear()
#define fi first
#define se second
#define mp make_pair
#define pi pair<int,int>
#define ers erase
#define lb lower_bound
#define ub upper_bound
#define rvs reverse
#define umap unordered_map
#define rsz resize
#define pq priority_queue
#define ps push
#define emt empty()
#define str string
#define gtl getline
#define pf push_front
#define vct vector<int>
#define unq unique
#define btc __builtin_popcount
#define me0(x) memset(x,0,sizeof(x))
#define mes(x,y) memset(x,y,sizeof(x))
#define bk back()
#define grt greater<int>
#define mne min_element
#define mxe max_element
#define jdi(s,x) (s.find(x)!=s.ed)
#define cmn(x,y) x=min(x,y)
#define cmx(x,y) x=max(x,y)
#define mad(x,y) ((x)=((x)+(y))%mo)
#define mde(x,y) ((x)=((x)+(mo-(y)))%mo)
#define mpl(x,y) (((x)+(y))%mo)
#define mdf(x,y) (((x)+(mo-(y)))%mo)
#define mmu(x,y) ((x)=((x)*(y))%mo)
#define lw(x) ((x)&(-x))
#define mcp(x,y) memcpy(x,y,sizeof(x))
#define gc getchar()
#define idg isdigit
#define rbg rbegin()
#define red rend()
#define emp emplace
#define fv(i,x) for(int i=0;i<sze(x);i++)
#define sze(x) ((int)(x).size())
#define all(x) (x).bg,(x).ed
using namespace std;
mt19937 noip2023;
#define oi noip2023()
const int N=5e5+5,mo=998244353;
int n,q,t[3][5];
char ss[N];
int qpow(int x,int y=mo-2){
	int mu=1;
	for(;y;y>>=1,x=x*x%mo)if(y&1)mu=mu*x%mo;
	return mu;
}
struct mat{
	int a[3][3];
	mat(){me0(a);}
	mat operator*(const mat&r)const{
		mat c;
		for(int i=1;i<=2;i++)for(int j=1;j<=2;j++)for(int k=1;k<=2;k++)
			mad(c.a[i][j],a[i][k]*r.a[k][j]%mo);
		return c;
	}
	bool operator==(const mat&r)const{
		for(int i=1;i<=2;i++)for(int j=1;j<=2;j++)if(a[i][j]!=r.a[i][j])return 0;
		return 1;	
	}
	mat inv(){
		me0(t);
		for(int i=1;i<=2;i++)t[i][i+2]=1;
		for(int i=1;i<=2;i++)for(int j=1;j<=2;j++)t[i][j]=a[i][j];
		for(int i=1;i<=2;i++){
			int r=i;
			for(int j=i;j<=2;j++)if(t[j][i]>t[r][i])r=j;
			swap(t[i],t[r]);
			for(int j=1;j<=2;j++){
				if(i==j)continue;
				int tt=t[j][i]*qpow(t[i][i])%mo;
				for(int k=i;k<=4;k++)mde(t[j][k],t[i][k]*tt%mo);
			}
			int tt=qpow(t[i][i]);
			for(int k=i;k<=4;k++)mmu(t[i][k],tt);
		}
		mat c;
		for(int i=1;i<=2;i++)for(int j=1;j<=2;j++)c.a[i][j]=t[i][j+2];
		return c;
	}
}o[3],p[3],I;
#define ls (x<<1)
#define rs (x<<1|1)
struct nd{mat v[3];int t;}a[N*4];
void up(int x){for(int i=0;i<3;i++)a[x].v[i]=a[ls].v[i]*a[rs].v[i];}
void cg(int x,int y){
	if(y==1)swap(a[x].v[0],a[x].v[1]),swap(a[x].v[1],a[x].v[2]);
	else swap(a[x].v[0],a[x].v[1]),swap(a[x].v[0],a[x].v[2]);
	a[x].t=(a[x].t+y)%3;
}
void dn(int x){if(!a[x].t)return;cg(ls,a[x].t),cg(rs,a[x].t),a[x].t=0;}
void bd(int x,int l,int r){
	if(l==r){
		int k=ss[l]-'0';
		if(l&1){for(int i=0;i<3;i++)a[x].v[i]=o[(k+i)%3];}
		else{for(int i=0;i<3;i++)a[x].v[i]=p[(k+i)%3];}
		return;
	}
	int mid=(l+r)>>1;
	bd(ls,l,mid),bd(rs,mid+1,r);
	up(x); 
}
void upd(int x,int l,int r,int L,int R){
	if(L<=l&&r<=R){cg(x,1);return;}
	dn(x);
	int mid=(l+r)>>1;
	if(L<=mid)upd(ls,l,mid,L,R);
	if(R>mid)upd(rs,mid+1,r,L,R);
	up(x);
}
mat qry(int x,int l,int r,int L,int R){
	if(L<=l&&r<=R)return a[x].v[0];
	dn(x);
	int mid=(l+r)>>1;mat mu=I;
	if(L<=mid)mu=qry(ls,l,mid,L,R);
	if(R>mid)mu=mu*qry(rs,mid+1,r,L,R);
	return mu;
}
#undef ls
#undef rs
signed main(){
	I.a[1][1]=I.a[2][2]=1;
	scanf("%lld%lld",&n,&q);
	for(int _=0;_<3;_++)for(int i=1;i<=2;i++)for(int j=1;j<=2;j++)o[_].a[i][j]=oi%mo;
	for(int i=0;i<3;i++)p[i]=o[i].inv();
	scanf("%s",ss+1);
	bd(1,1,n);
	while(q--){
		int op,l,r;
		scanf("%lld%lld%lld",&op,&l,&r);
		if(op==1)upd(1,1,n,l,r);
		else puts(qry(1,1,n,l,r)==I?"Yes":"No");
	}
	return 0;
}