#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vp vector<pii>
#define mp make_pair

//#define LOCALJUDGE
#define int ll
bool ST;
static const ll MOD=998244353,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,INF=4557430888798830399;
static const double eps=1e-6,pi=3.1415926535;
char in[1<<20],*p1=in,*p2=in;
using namespace std;
//#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,1<<20,stdin),p1==p2)?EOF:*p1++)
struct tup{int x,y,z;tup(int X=0,int Y=0,int Z=0){x=X,y=Y,z=Z;}};
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[25];int top=0;
			do{st[top++]=x%10+'0',x/=10;}while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' ')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		s=0;char ch=getchar();
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-')&&(ch=getchar());
		while((ch>='0')&&(ch<='9'))s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=(tf?-s:s);
	}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
	int n,m;
	char s[500010];
	struct Matrix{int f[2][2];}iX[3],X[3],mm;
	Matrix operator *(const Matrix m1,const Matrix m2)
	{
		Matrix m3;
		m3.f[0][0]=Cadd(Cmul(m1.f[0][0],m2.f[0][0]),Cmul(m1.f[0][1],m2.f[1][0]));
		m3.f[0][1]=Cadd(Cmul(m1.f[0][0],m2.f[0][1]),Cmul(m1.f[0][1],m2.f[1][1]));
		m3.f[1][0]=Cadd(Cmul(m1.f[1][0],m2.f[0][0]),Cmul(m1.f[1][1],m2.f[1][0]));
		m3.f[1][1]=Cadd(Cmul(m1.f[1][0],m2.f[0][1]),Cmul(m1.f[1][1],m2.f[1][1]));
		return m3;
	}
	Matrix inv(Matrix m1)
	{
		Matrix m2;
		int a=m1.f[0][0],b=m1.f[0][1],c=m1.f[1][0],d=m1.f[1][1];
		m2.f[1][0]=Cmul(c,power(Cdel(Cmul(b,c),Cmul(a,d)),MOD-2));
		m2.f[1][1]=Cmul(a,power(Cdel(Cmul(a,d),Cmul(b,c)),MOD-2));
		m2.f[0][0]=Cmul(MOD-m2.f[1][0],d,power(c,MOD-2));
		m2.f[0][1]=Cmul(MOD-m2.f[1][1],b,power(a,MOD-2));
		return m2;
	}
	mt19937 rnd(time(0));
	#define rd(l,r) ((l)+rnd()%((int)((r)-(l)+1)))
	namespace Segment
	{
		#define ls(x) (t[x].l+t[x].r)
		#define rs(x) (ls(x)^1)
		struct{int l,r,tg;Matrix X[3];}t[1000010];
		inline void update(int p){for(int i=0;i<3;++i)t[p].X[i]=t[ls(p)].X[i]*t[rs(p)].X[i];}
		inline void down(int p,int v)
		{
			t[p].tg+=v,t[p].tg%=3;
			if(!v)return;
			if(v==1)mm=t[p].X[0],t[p].X[0]=t[p].X[1],t[p].X[1]=t[p].X[2],t[p].X[2]=mm;
			else mm=t[p].X[2],t[p].X[2]=t[p].X[1],t[p].X[1]=t[p].X[0],t[p].X[0]=mm;
		}
		inline void spread(int p){down(ls(p),t[p].tg),down(rs(p),t[p].tg),t[p].tg=0;}
		void build(int p,int l,int r)
		{
			t[p].l=l,t[p].r=r;
			if(l==r)
			{
				if(l&1)for(int i=0;i<3;++i)t[p].X[i]=X[(s[l]-'0'+i)%3];
				else for(int i=0;i<3;++i)t[p].X[i]=iX[(s[l]-'0'+i)%3];
				return;
			}
			int mid=l+((r-l)>>1);
			build(ls(p),l,mid),build(rs(p),mid+1,r),update(p);
		}
		Matrix ask(int p,int l,int r)
		{
			if(l<=t[p].l&&r>=t[p].r)return t[p].X[0];
			spread(p);
			if(r<=t[ls(p)].r)return ask(ls(p),l,r);
			if(l>t[ls(p)].r)return ask(rs(p),l,r);
			return ask(ls(p),l,r)*ask(rs(p),l,r);
		}
		inline void modify(int p,int l,int r)
		{
			if(l<=t[p].l&&r>=t[p].r)return down(p,1);
			spread(p);
			if(l<=t[ls(p)].r)modify(ls(p),l,r);
			if(r>t[ls(p)].r)modify(rs(p),l,r);
			update(p);
		}
	}
	using namespace Segment;
	inline void mian()
	{
		for(int i=0;i<3;++i)
		{
			for(int j=0;j<2;++j)for(int k=0;k<2;++k)X[i].f[j][k]=rd(0,998244352);
			iX[i]=inv(X[i]);
		}
		read(n,m),scanf("%s",s+1),build(1,1,n);int x,y,opt;
		mm=ask(1,4,5);
		while(m--)
		{
			read(opt,x,y);
			if(opt==1)modify(1,x,y);
			else
			{
				mm=ask(1,x,y);
				if(mm.f[0][0]==1&&mm.f[0][1]==0&&mm.f[1][0]==0&&mm.f[1][1]==1)puts("Yes");
				else puts("No");
			}
		}
	}
}
bool ED;
signed main()
{
	#ifdef LOCALJUDGE
	freopen("1.in","r",stdin);
	freopen("1.out","w",stdout);
	#endif
	double st=clock();
	WrongAnswer_90::mian();
	double ed=clock();
	#ifndef LOCALJUDGE
 	cerr<<endl;
	#endif
 	cerr<<"Time: "<<ed-st<<" ms\n";
	#ifdef LOCALJUDGE
 	cerr<<"     ";
	#endif
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}