#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <unordered_map>
#define ll long long
#define reg register
#define fo(a,b,c) for(reg ll a=b;a<=c;a++)
#define re(a,b,c) for(reg ll a=b;a>=c;a--)
#define pb push_back
#define pii pair<ll,ll>
#define fi first
#define se second
#define mod 1000000007
using namespace std;
ll _=1;
const ll N=500005;
inline ll gi(){
    ll x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9'){
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){
        x = (x<<1) + (x<<3) + (ch^48);
        ch = getchar();
    }
    return x * f;
}
char s[N];
#include<random>
mt19937 rnd(36211);
struct mat
{
	ll a[3][3];
	ll n,m;
	void mk()
	{
		fo(i,1,n)
		{
			fo(j,1,n)
			{
				a[i][j]=rnd()%mod;
			}
		}
	}
	ll ck()
	{
		return (a[1][1]==1&&a[2][2]==1&&a[1][2]==0&&a[2][1]==0);
	}
	mat operator *(const mat b)const
	{
		mat c;
		c.n=n;
		c.m=b.m;
		fo(i,1,n)
		{
			fo(j,1,b.m)
			{
				c.a[i][j]=0;
				fo(k,1,m)
				{
					c.a[i][j]+=a[i][k]*b.a[k][j]%mod;
					c.a[i][j]%=mod;
				}
			}
		}
		return c;
	}
}O[3],Oinv[3],I;
mat ksm(mat a,ll b)
{
	mat c=I;
	while(b)
	{
		if(b%2) c=c*a;
		a=a*a;
		b/=2;
	}
	return c;
}
struct IO
{
	mat mt[3];
	ll tag;
}node[N*4];
void wk(ll rt,ll z)
{
	node[rt].tag+=z;
	node[rt].tag%=3;
	if(z==1)
	{
		mat zs=node[rt].mt[0];
		node[rt].mt[0]=node[rt].mt[1];
		node[rt].mt[1]=node[rt].mt[2];
		node[rt].mt[2]=zs;
		return;
	}
	mat zs=node[rt].mt[2];
	node[rt].mt[2]=node[rt].mt[1];
	node[rt].mt[1]=node[rt].mt[0];
	node[rt].mt[0]=zs;
}
void pp(ll rt)
{
	fo(i,0,2)
	{
		node[rt].mt[i]=node[rt*2].mt[i]*node[rt*2+1].mt[i];
	}
}
void bt(ll rt,ll l,ll r)
{
	if(l==r)
	{
		ll nw=s[l]-'0';
		if(l%2) fo(i,0,2) node[rt].mt[i]=O[(nw+i)%3];
		else fo(i,0,2) node[rt].mt[i]=Oinv[(nw+i)%3];
		return;
	}
	ll mid=(l+r)/2;
	bt(rt*2,l,mid);
	bt(rt*2+1,mid+1,r);
	pp(rt);
}
void pd(ll rt)
{
	if(node[rt].tag)
	{
		wk(rt*2,node[rt].tag);
		wk(rt*2+1,node[rt].tag);
		node[rt].tag=0;
	}
}
void ud(ll rt,ll l,ll r,ll L,ll R,ll val)
{
	if(L<=l&&r<=R)
	{
		wk(rt,val);
		return;
	}
	pd(rt);
	ll mid=(l+r)/2;
	if(L<=mid) ud(rt*2,l,mid,L,R,val);
	if(R>mid) ud(rt*2+1,mid+1,r,L,R,val);
	pp(rt);
}
mat qr(ll rt,ll l,ll r,ll L,ll R)
{
	if(L<=l&&r<=R) return node[rt].mt[0];
	pd(rt);
	ll mid=(l+r)/2;
	mat zs=I;
	if(L<=mid) zs=zs*qr(rt*2,l,mid,L,R);
	if(R>mid) zs=zs*qr(rt*2+1,mid+1,r,L,R);
	return zs;
}
int main()
{
	I.n=2;
	I.m=2;
	I.a[1][1]=1;
	I.a[2][2]=1;
	fo(i,0,2)
	{
		O[i].n=2;
		O[i].m=2;
		O[i].mk();
		while(ksm(O[i],mod-1).ck()==0||O[i].ck()) O[i].mk();
		Oinv[i]=ksm(O[i],mod-2);
	}
	ll n=gi(),q=gi();
	cin>>s+1;
	bt(1,1,n);
	while(q--)
	{
		ll op=gi(),l=gi(),r=gi();
		if(op==2)
		{
			mat z=qr(1,1,n,l,r);
			if(z.ck())
			{
				cout<<"Yes\n";
			}
			else
			{
				cout<<"No\n";
			}
		}
		else
		{
			ud(1,1,n,l,r,1);
		}
	}
	return 0;
}