#include<iostream>
#include<cstdio>
#include<random>
#include<ctime>
#include<cstdlib>
#include<cassert>
#define N 500000
#define mod 998244353
using namespace std;
mt19937 RAND(time(0));
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
struct matrix
{
	int d[4][4];
	bool operator == (const matrix &t)const
	{
		for (int i=1;i<=3;++i)
			for (int j=1;j<=3;++j)
				if (d[i][j]!=t.d[i][j])
					return 0;
		return 1;
	}
};
matrix y,c,e,zero,delta[3],tmp,a[N+1];
matrix operator * (matrix a,matrix b)
{
	c=zero;
	for (int k=1;k<=3;++k)
		for (int i=1;i<=3;++i)
			for (int j=1;j<=3;++j)
				Adder(c.d[i][j],1ll*a.d[i][k]*b.d[k][j]%mod);
	return c;
}
bool check(matrix x)
{
	int d;
	for (int i=1;i<=3;++i)
	{
		for (int j=i+1;j<=3;++j)
			if (!x.d[i][i]&&x.d[j][i])
				swap(x.d[i],x.d[j]);
		if (!x.d[i][i]) return 0;
		for (int j=i+1;j<=3;++j)
		{
			d=1ll*x.d[j][i]*fast_pow(x.d[i][i],mod-2)%mod;
			for (int k=i;k<=3;++k) Adder2(x.d[j][k],-1ll*x.d[i][k]*d%mod);
		}
	}
	return 1;
}
matrix get_inv(matrix x)
{
	int d;
	y=e;
	for (int i=1;i<=3;++i)
	{
		for (int j=i+1;j<=3;++j)
			if (!x.d[i][i]&&x.d[j][i])
				swap(x.d[i],x.d[j]),swap(y.d[i],y.d[j]);
		for (int j=i+1;j<=3;++j)
		{
			d=1ll*x.d[j][i]*fast_pow(x.d[i][i],mod-2)%mod;
			for (int k=1;k<=3;++k) Adder2(x.d[j][k],-1ll*x.d[i][k]*d%mod),Adder2(y.d[j][k],-1ll*y.d[i][k]*d%mod);
		}
	}
	for (int i=3;i>=1;--i)
	{
		for (int j=i+1;j<=3;++j)
		{
			d=x.d[i][j];
			for (int k=1;k<=3;++k) Adder2(x.d[i][k],-1ll*x.d[j][k]*d%mod),Adder2(y.d[i][k],-1ll*y.d[j][k]*d%mod);
		}
		d=fast_pow(x.d[i][i],mod-2);
		for (int j=1;j<=3;++j) x.d[i][j]=1ll*x.d[i][j]*d%mod,y.d[i][j]=1ll*y.d[i][j]*d%mod;
	}
	return y;
}
int n,q;
char cs[N+1];
struct seg
{
	struct node
	{
		int l,r,lazy;
		matrix data[3];
	};
	node tree[(N<<2)+1];
	void push_up(int k)
	{
		for (int i=0;i<=2;++i) tree[k].data[i]=tree[k<<1].data[i]*tree[k<<1|1].data[i];
		return;	
	}
	void get_shift(int k,int d)
	{
		for (int i=1;i<=d;++i) tmp=tree[k].data[0],tree[k].data[0]=tree[k].data[1],tree[k].data[1]=tree[k].data[2],tree[k].data[2]=tmp;
		tree[k].lazy=(tree[k].lazy+d)%3;
		return;
	}
	void spread(int k)
	{
		if (tree[k].lazy) get_shift(k<<1,tree[k].lazy),get_shift(k<<1|1,tree[k].lazy),tree[k].lazy=0;
		return;
	}
	void build(int k,int l,int r)
	{
		tree[k].l=l,tree[k].r=r;
		if (l==r)
		{
			for (int i=0;i<=2;++i)
			{
				if (l&1) tree[k].data[i]=delta[(cs[l]-'0'+i)%3];
				else tree[k].data[i]=get_inv(delta[(cs[l]-'0'+i)%3]);
			}
			return;
		}
		int mid=(l+r)>>1;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r),push_up(k);
		return;
	}
	void add(int k,int l,int r)
	{
		if (tree[k].l==l&&tree[k].r==r)
		{
			get_shift(k,1);
			return;
		}
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) add(k<<1,l,r);
		else if (l>=mid+1) add(k<<1|1,l,r);
		else add(k<<1,l,mid),add(k<<1|1,mid+1,r);
		push_up(k);
		return;	
	}
	matrix query(int k,int l,int r)
	{
		if (tree[k].l==l&&tree[k].r==r) return tree[k].data[0];
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) return query(k<<1,l,r);
		else if (l>=mid+1) return query(k<<1|1,l,r);
		else return query(k<<1,l,mid)*query(k<<1|1,mid+1,r);
	}
};
seg T;
int main()
{
	int op,l,r;
	n=read(),q=read();
	for (int i=1;i<=3;++i) e.d[i][i]=1;
	for (int i=0;i<=2;++i)
	{
		while (1)
		{
			for (int j=1;j<=3;++j)
				for (int k=1;k<=3;++k)
					delta[i].d[j][k]=RAND()%mod;
			if (check(delta[i])) break;
		}
	}
	for (int i=1;i<=n;++i) cin>>cs[i];
	T.build(1,1,n);
	while (q--)
	{
		op=read(),l=read(),r=read();
		if (op==1) T.add(1,l,r);
		else puts(T.query(1,l,r)==e?"Yes":"No");
	}
	return 0;
}