#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5,K = 2,P = 1e9 + 7;
inline void Plus(int &x,const int &y) { x += y;if(x >= P) x -= P;}
inline int qpow(int a,int b) { int res = 1;while(b) {if(b&1) res = 1ll * res * a % P; a = 1ll * a * a % P;b >>= 1;} return res;}
struct Mat {
	int a[K][K];
	Mat() { memset(a,0,sizeof a);}
	Mat operator * (const Mat &rhs) const {
		Mat res;
		for(int i = 0;i < K;i++)
			for(int k = 0;k < K;k++)
				for(int j = 0;j < K;j++)
					Plus(res.a[i][j],1ll * this->a[i][k] * rhs.a[k][j] % P);
		return res;
	}
	int Det() const { return ((1ll * a[0][0] * a[1][1] - 1ll * a[0][1] * a[1][0]) % P + P) % P;}
	Mat Inverse() const {
		Mat res;
		res.a[0][0] = this->a[1][1];res.a[1][1] = this->a[0][0];
		res.a[0][1] = P - this->a[0][1];res.a[1][0] = P - this->a[1][0];
		int inv = qpow(Det(),P - 2);
		for(int i = 0;i < K;i++) for(int j = 0;j < K;j++) res.a[i][j] = 1ll * res.a[i][j] * inv % P;
		return res;
	}
};
Mat M[3],_M[3];
mt19937 Rnd(114514);
int n,q,a[N];
Mat tr[N << 2][3]; // 第二维表示上方标记为几时的矩阵情况
int tag[N << 2];
inline void pushup(int k) {
	for(int t = 0;t < 3;++t) tr[k][t] = tr[k << 1][t] * tr[k << 1 | 1][t];
}
inline void Giv(int k,int v) { 
	Mat tmp[3];
	for(int i = 0;i < 3;i++) tmp[(i + 3 - v) % 3] = tr[k][i];
	for(int i = 0;i < 3;i++) tr[k][i] = tmp[i];
	(tag[k] += v) %= 3;
}
inline void pushdown(int k) { if(tag[k]) Giv(k << 1,tag[k]),Giv(k << 1 | 1,tag[k]),tag[k] = 0;}
inline void modify(int k,int l,int r,int x,int y,int v) {
	if(x <= l && r <= y) return Giv(k,v);
	int mid = l + r >> 1;
	pushdown(k);
	if(x <= mid) modify(k << 1,l,mid,x,y,v);
	if(mid < y) modify(k << 1 | 1,mid + 1,r,x,y,v);
	pushup(k);
}
void build(int k,int l,int r) {
	tag[k] = 0;
	if(l == r) {
		for(int i = 0;i < 3;i++) tr[k][i] = (l & 1) ? M[(a[l] + i) % 3] : _M[(a[l] + i) % 3];
		return;
	}
	int mid = l + r >> 1;
	build(k << 1,l,mid);build(k << 1 | 1,mid + 1,r);
	pushup(k);
}
Mat Query(int k,int l,int r,int x,int y) {
	if(x <= l && r <= y) return tr[k][0];
	int mid = l + r >> 1;
	pushdown(k);
	if(y <= mid) return Query(k << 1,l,mid,x,y);
	else if(x > mid) return Query(k << 1 | 1,mid + 1,r,x,y);
	else return Query(k << 1,l,mid,x,y) * Query(k << 1 | 1,mid + 1,r,x,y);
}
int main() {
	cin >> n >> q;
	string s;
	cin >> s;
	for(int i = 1;i <= n;i++) a[i] = s[i - 1] - '0';
	for(int t = 0;t < 3;t++) {
		for(int i = 0;i < 2;i++) for(int j = 0;j < 2;j++) M[t].a[i][j] = Rnd() % P;
		while(M[t].Det() == 0) {
			for(int i = 0;i < 2;i++) for(int j = 0;j < 2;j++) M[t].a[i][j] = Rnd() % P;
		}
		_M[t] = M[t].Inverse();
	}
	build(1,1,n);
	for(int i = 1;i <= q;i++) {
		int op,l,r;
		cin >> op >> l >> r;
		if(op == 1) modify(1,1,n,l,r,1);
		else {
			Mat res = Query(1,1,n,l,r);
			if(res.a[0][0] == 1 && res.a[1][1] == 1 && res.a[0][1] == 0 && res.a[1][0] == 0)
				puts("Yes");
			else puts("No");
		}
	}
	return 0;
}