#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod=998244353;
ll ksm(ll a,ll x){
	ll ret=1;
	for (;x;x>>=1,a=1LL*a*a%mod) if (x&1) ret=1LL*ret*a%mod;
	return ret;	
}
ll inv(ll a){return ksm(a,mod-2);}

mt19937_64 rng(58);
struct matrix{
	ll m[2][2];
	matrix(){
		memset(m,0,sizeof(m));	
	}
	void unit(){
		m[0][0]=m[1][1]=1;	
	}
	friend matrix operator * (const matrix &A,const matrix &B){
		matrix C;
		for (int i=0;i<2;i++)
			for (int k=0;k<2;k++)
				for	(int j=0;j<2;j++) C.m[i][j]=(C.m[i][j]+1LL*A.m[i][k]*B.m[k][j])%mod;
		return C;
	}
	matrix INV(){
		ll abs=((1LL*m[0][0]*m[1][1]-1LL*m[0][1]*m[1][0])%mod+mod)%mod;
		ll iabs=inv(abs);
		matrix ans;
		ans.m[0][0]=m[1][1];ans.m[0][1]=mod-m[0][1];
		ans.m[1][0]=mod-m[1][0];ans.m[1][1]=m[0][0];
		for (int i=0;i<2;i++)
			for (int j=0;j<2;j++) ans.m[i][j]=1LL*ans.m[i][j]*iabs % mod;
		return ans;
	}
	void RNG(){
		for (int i=0;i<2;i++)
			for (int j=0;j<2;j++) m[i][j]=rng()%mod;
	}
	void print(){
		cerr << "[";
		for (int i=0;i<2;i++){
			cerr << "[";
			for (int j=0;j<2;j++) cerr << m[i][j] << ",";
			cerr << "],";
		}
		cerr << "] ";
	}
};

matrix A[10];
matrix B[10];
matrix one;
void prepare(){
	for (int i=0;i<3;i++) A[i].RNG();
	for (int i=0;i<3;i++) B[i]=A[i].INV();
	/*
	for (int i=0;i<3;i++){
		A[i].print();
		cerr << endl;
	}
	cerr << "++" << endl;
	for (int i=0;i<3;i++){
		B[i].print();
		cerr << endl;
	}
	for (int i=0;i<3;i++) (A[i]*B[i]).print();
	cerr << endl;
	*/
	one.unit();
}

const int maxn=500000;
int n,Q;
int a[maxn+50];

struct node{
	int tag;
	matrix res[3];	
}tr[maxn*4+50];

void pushup(int x){
	for (int i=0;i<3;i++)
		tr[x].res[i]=tr[x<<1].res[i]*tr[(x<<1)|1].res[i];	
}
void build(int x,int l,int r){
	if (l==r){
		tr[x].tag=0;
		for (int i=0;i<3;i++){
			if (l%2==1){
				tr[x].res[i]=A[(i+a[l])%3];
			}
			else{
				tr[x].res[i]=B[(i+a[l])%3];	
			}
		}
		/*
		cerr << "l : " << l << endl;
		cerr << "tr[x]: " << endl;
		tr[x].res[0].print();
		cerr << endl;
		*/
		return;	
	}
	int mid=(l+r)>>1;
	build(x<<1,l,mid);
	build((x<<1)|1,mid+1,r);
	pushup(x);
}
void mark(int x,int add){
	node tmp;
	(tr[x].tag+=add)%=3;
	for (int i=0;i<3;i++) tmp.res[i]=tr[x].res[(i+add)%3];
	for (int i=0;i<3;i++) tr[x].res[i]=tmp.res[i];
}
void pushdown(int x){
	mark(x<<1,tr[x].tag);
	mark((x<<1)|1,tr[x].tag);
	tr[x].tag=0;
}
void modify(int x,int l,int r,int ql,int qr){
	if (ql<=l && r<=qr){
		mark(x,1);
		return;
	}
	pushdown(x);
	int mid=(l+r)>>1;
	if (ql<=mid) modify(x<<1,l,mid,ql,qr);
	if (mid+1<=qr) modify((x<<1)|1,mid+1,r,ql,qr);
	pushup(x);
}
matrix query(int x,int l,int r,int ql,int qr){
	if (ql<=l && r<=qr){
	//	cerr << "l,r : " << l << " " << r << endl;
	//	tr[x].res[0].print();
	//	cerr << endl;
		return tr[x].res[0];
	}
	pushdown(x);
	matrix ans;
	ans.unit();
	int mid=(l+r)>>1;
	if (ql<=mid) ans=ans*query(x<<1,l,mid,ql,qr);
	if (mid+1<=qr) ans=ans*query((x<<1)|1,mid+1,r,ql,qr);
	pushup(x);
	return ans;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	prepare();
	cin >> n >> Q;
//	n=Q=maxn;
	{
		string str;
		cin >> str;
		for (int i=1;i<=n;i++) a[i]=str[i-1]-'0';
	}
	build(1,1,n);
	
	for (;Q--;){
		int opt,l,r;
	//	opt=2;
	//	l=1;
	//	r=1;
		cin >> opt >> l >> r;
		if (opt==1){
			modify(1,1,n,l,r);
		}
		else{
			matrix A=query(1,1,n,l,r);
			bool flag=1;
			for (int i=0;i<2;i++)
				for (int j=0;j<2;j++) if (A.m[i][j]!=one.m[i][j]) flag=0;
			if (flag) cout << "Yes" << "\n";
			else cout << "No" << "\n";
		}
	}
	return 0;
}