#include<bits/stdc++.h>
using namespace std;
#define il inline
#define fi first
#define se second
#define mk make_pair
#define eb emplace_back
#define rep(i,l,r) for(int i=(l); i<=(r); ++i)
#define rep_(i,l,r) for(int i=(l); i>=(r); --i)
typedef unsigned long long lr;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
constexpr int mod1=998244353,mod2=1e9+7;
constexpr db pi=3.141592653589793,eps=1e-9;
constexpr int inf32=0x3f3f3f3f,Inf32=0xc0c0c0c0;
constexpr lr inf64=0x3f3f3f3f3f3f3f3f,Inf64=0xc0c0c0c0c0c0c0c0;
template<typename T>il T Max(T x,T y) { return (x>y)? x:y; }
template<typename T>il T Min(T x,T y) { return (x<y)? x:y; }
template<typename T>il T gcd(T x,T y) { return (!y)? x:gcd(y,x%y); }
template<typename T>il T Abs(T x) { return (x>0)? x:(-x); }
template<typename T>il T Rnd(T l,T r,mt19937_64 &eng)
{
	uniform_int_distribution<T> uid(l,r);
	return uid(eng);
}
mt19937_64 eng(chrono::high_resolution_clock::now().time_since_epoch().count());
constexpr int N=500500,mod=mod2;
il void Reduce(int &_) { (_>=mod)&&(_-=mod); }
struct mat
{
	int g00,g01,g10,g11;
	mat() {}
	mat(int G00,int G01,int G10,int G11) { g00=G00,g01=G01,g10=G10,g11=G11; }
};
mat I(1,0,0,1),P[3],Q[3],res;
struct node { mat m[3]; };
node tr[N<<2]; int tag[N<<2];
il void Nxt(int &_) { (_&2)? _=0:++_; }
il void Lst(int &_) { (_  )? --_:_=2; }
il bool operator ==(const mat &X,const mat &Y)
{
	return (X.g00==Y.g00)&&
		   (X.g01==Y.g01)&&
		   (X.g10==Y.g10)&&
		   (X.g11==Y.g11);
}
il mat operator *(const mat &X,const mat &Y)
{
	return (mat){(int)(((lr)X.g00*Y.g00+(lr)X.g01*Y.g10)%mod),
				 (int)(((lr)X.g00*Y.g01+(lr)X.g01*Y.g11)%mod),
				 (int)(((lr)X.g10*Y.g00+(lr)X.g11*Y.g10)%mod),
				 (int)(((lr)X.g10*Y.g01+(lr)X.g11*Y.g11)%mod)};
}
int n,q,a[N]; string s;
il void Build(int k,int l,int r)
{
	if(l==r)
	{
		int x=a[l],y=(x&2)? 0:(x+1),z=(y&2)? 0:(y+1);
		tr[k].m[0]=(l&1)? P[x]:Q[x];
		tr[k].m[1]=(l&1)? P[y]:Q[y];
		tr[k].m[2]=(l&1)? P[z]:Q[z];
		return;
	}
	int mid=(l+r)>>1;
	Build(k<<1,l,mid),Build(k<<1|1,mid+1,r);
	tr[k].m[0]=tr[k<<1].m[0]*tr[k<<1|1].m[0];
	tr[k].m[1]=tr[k<<1].m[1]*tr[k<<1|1].m[1];
	tr[k].m[2]=tr[k<<1].m[2]*tr[k<<1|1].m[2];
}
il void Pushdown(int k)
{
	if(tag[k]&1)
	{
		Nxt(tag[k<<1]),swap(tr[k<<1].m[0],tr[k<<1].m[1]),swap(tr[k<<1].m[1],tr[k<<1].m[2]);
		Nxt(tag[k<<1|1]),swap(tr[k<<1|1].m[0],tr[k<<1|1].m[1]),swap(tr[k<<1|1].m[1],tr[k<<1|1].m[2]);
	}
	if(tag[k]&2)
	{
		Lst(tag[k<<1]),swap(tr[k<<1].m[2],tr[k<<1].m[1]),swap(tr[k<<1].m[1],tr[k<<1].m[0]);
		Lst(tag[k<<1|1]),swap(tr[k<<1|1].m[2],tr[k<<1|1].m[1]),swap(tr[k<<1|1].m[1],tr[k<<1|1].m[0]);
	}
	tag[k]=0;
}
il void Modify(int k,int l,int r,int x,int y)
{
	if(l>y||r<x)
		return;
	if(l>=x&&r<=y)
	{
		Nxt(tag[k]),swap(tr[k].m[0],tr[k].m[1]),swap(tr[k].m[1],tr[k].m[2]);
		return;
	}
	Pushdown(k);
	int mid=(l+r)>>1;
	Modify(k<<1,l,mid,x,y),Modify(k<<1|1,mid+1,r,x,y);
	tr[k].m[0]=tr[k<<1].m[0]*tr[k<<1|1].m[0];
	tr[k].m[1]=tr[k<<1].m[1]*tr[k<<1|1].m[1];
	tr[k].m[2]=tr[k<<1].m[2]*tr[k<<1|1].m[2];
}
il void Query(int k,int l,int r,int x,int y)
{
	if(l>y||r<x)
		return;
	if(l>=x&&r<=y)
		return res=res*tr[k].m[0],void();
	Pushdown(k);
	int mid=(l+r)>>1;
	Query(k<<1,l,mid,x,y),Query(k<<1|1,mid+1,r,x,y);
}
il void Solve()
{
	P[0]=(mat){993244853,998244853,998244353,993244353},Q[0]=(mat){379627167,808198570, 84352167,655780771};
	P[1]=(mat){998244353,993244853,998244853,993244353},Q[1]=(mat){271643428,192335906,985643433,478335908};
	P[2]=(mat){998244853,998244353,993244853,993244353},Q[2]=(mat){828185397,885814615,600386013,685613996}; 
	cin>>n>>q>>s,s=" "+s;
	rep(i,1,n)
		a[i]=s[i]^48;
	Build(1,1,n);
	while(q--)
	{
		int op,l,r; cin>>op>>l>>r;
		if(op==1)
			Modify(1,1,n,l,r);
		if(op==2)
		{
			res=I,Query(1,1,n,l,r);
			if(res==I)
				cout<<"Yes\n";
			else
				cout<<"No\n";
		}
	}
}
int main()
{
#ifdef LOCAL
	string fpre="test",isuf="in",osuf="out";
	assert(freopen((fpre+"."+isuf).c_str(),"r",stdin));
	assert(freopen((fpre+"."+osuf).c_str(),"w",stdout));
#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T=1;
	while(T--)
		Solve();
	return 0;
}