#include <bits/stdc++.h>
using namespace std;
#define lc(x) x<<1
#define rc(x) x<<1|1
int n, m, op, l, r, a[500010], d[2000010];
char s[500010];
struct matrix{
	int c[3][3];
	void clear(){
		for (int i=1; i<=2; i++){
			for (int j=1; j<=2; j++){
				if (i == j) c[i][j] = 1;
				else c[i][j] = 0;
			}
		}
	}
}mt[3][2], tag[2000010][3];
const int mo = 1e9 + 7;
matrix mul(matrix x, matrix y){
	matrix ret;
	for (int i=1; i<=2; i++){
		for (int j=1; j<=2; j++){
			ret.c[i][j] = 0;
			for (int k=1; k<=2; k++){
				ret.c[i][j] = (ret.c[i][j] + 1LL * x.c[i][k] * y.c[k][j] % mo) % mo;
			}
		}
	}
	return ret;
}
matrix operator * (matrix x, matrix y){
	return mul(x, y);
}
void pushup(int k){
	tag[k][0] = tag[lc(k)][0] * tag[rc(k)][0];
	tag[k][1] = tag[lc(k)][1] * tag[rc(k)][1];
	tag[k][2] = tag[lc(k)][2] * tag[rc(k)][2];
}
void pushdown(int k, int l, int r){
//	printf ("%d %d : %d\n", l, r, d[k]);
	if (d[k]){
		d[lc(k)] = (d[lc(k)] + d[k]) % 3;
		d[rc(k)] = (d[rc(k)] + d[k]) % 3;
		if (d[k] == 1){	
			matrix tmp = tag[lc(k)][0];
			tag[lc(k)][0] = tag[lc(k)][1], tag[lc(k)][1] = tag[lc(k)][2], tag[lc(k)][2] = tmp;
			tmp = tag[rc(k)][0];
			tag[rc(k)][0] = tag[rc(k)][1], tag[rc(k)][1] = tag[rc(k)][2], tag[rc(k)][2] = tmp;
		}
		else if (d[k] == 2){
			matrix tmp = tag[lc(k)][0];
			tag[lc(k)][0] = tag[lc(k)][2], tag[lc(k)][2] = tag[lc(k)][1], tag[lc(k)][1] = tmp;
			tmp = tag[rc(k)][0];
			tag[rc(k)][0] = tag[rc(k)][2], tag[rc(k)][2] = tag[rc(k)][1], tag[rc(k)][1] = tmp;
		}
		d[k] = 0;
	}
}
void build(int k, int l, int r){
	if (l == r){
		tag[k][0] = mt[a[l]][l%2];
		tag[k][1] = mt[(a[l]+1)%3][l%2];
		tag[k][2] = mt[(a[l]+2)%3][l%2];
		return ;
	}
	int mid = l + r >> 1;
	build(lc(k), l, mid);
	build(rc(k), mid+1, r);
	pushup(k);
}
void print(matrix x){
	for (int i=1; i<=2; i++){
		for (int j=1; j<=2; j++){
			printf ("%d ", x.c[i][j]);
		}
		puts ("");
	}
	puts ("");
}
void modify(int k, int l, int r, int x, int y){
	if (x <= l && r <= y){
		d[k] = (d[k] + 1) % 3;
	//	printf ("modify %d %d : %d\n", l, r, d[k]);
		if (l == r && r == 7){
		//	puts ("fir");
		//	print(tag[k][0]);
		//	print(tag[k][1]);
		//	print(tag[k][2]);
		//	puts ("end");
		}
		matrix tmp = tag[k][0];
		tag[k][0] = tag[k][1], tag[k][1] = tag[k][2], tag[k][2] = tmp;
		if (l == r && r == 7){
		//	puts ("now :");
		//	print(tag[k][0]);
		}
	//	if (l == r && r == 6) print(tag[k][0]);
		return ;
	}
	int mid = l + r >> 1;
	pushdown(k, l, r);
	if (x <= mid) modify(lc(k), l, mid, x, y);
	if (y > mid) modify(rc(k), mid+1, r, x, y);
	pushup(k);
}
matrix query(int k, int l, int r, int x, int y){
	if (x <= l && r <= y) return tag[k][0];
	int mid = l + r >> 1;
	matrix ret;
	ret.clear();
	pushdown(k, l, r);
	if (x <= mid) ret = ret * query(lc(k), l, mid, x, y);
	if (y > mid) ret = ret * query(rc(k), mid+1, r, x, y);
	return ret; 
}
int pd(matrix x){
	for (int i=1; i<=2; i++){
		for (int j=1; j<=2; j++){
			if (i == j && x.c[i][j] != 1) return 0;
			if (i != j && x.c[i][j] != 0) return 0;
		}
	}
	return 1;
}

void print_all(int k, int l, int r){
	if (l == r){
		printf ("matrix %d\n", l);
		print(tag[k][0]);
		return ;
	}
	int mid = l + r >> 1;
	pushdown(k, l, r);
	print_all(lc(k), l, mid);
	print_all(rc(k), mid+1, r);
}
int main(){
	scanf ("%d%d%s", &n, &m, s+1);
	for (int i=1; i<=n; i++){
		a[i] = s[i] - '0';
	}
	mt[0][0].c[1][1] = 1, mt[0][0].c[1][2] = 2, mt[0][0].c[2][1] = 3, mt[0][0].c[2][2] = 4;//原矩阵 
	mt[0][1].c[1][1] = 1000000005, mt[0][1].c[1][2] = 1, mt[0][1].c[2][1] = 500000005, mt[0][1].c[2][2] = 500000003;//逆矩阵 
	
	mt[1][0].c[1][1] = 10, mt[1][0].c[1][2] = 25, mt[1][0].c[2][1] = 18, mt[1][0].c[2][2] = 33;
	mt[1][1].c[1][1] = 325000002, mt[1][1].c[1][2] = 208333335, mt[1][1].c[2][1] = 550000004, mt[1][1].c[2][2] = 916666673;
	
	mt[2][0].c[1][1] = 123, mt[2][0].c[1][2] = 256, mt[2][0].c[2][1] = 164, mt[2][0].c[2][2] = 520;
	mt[2][1].c[1][1] = 429923556, mt[2][1].c[1][2] = 342191484, mt[2][1].c[2][1] = 156716419, mt[2][1].c[2][2] = 632462691;
	
//	print(mt[2][0]*mt[2][1]);
	
	build(1, 1, n);
//	printf ("%d\n", pd(query(1, 1, n, 1, n)));
	for (int i=1; i<=m; i++){
		scanf ("%d%d%d", &op, &l, &r);
		if (op == 1){
			modify(1, 1, n, l, r);
		//	if (i >= 7) print_all(1, 1, n);
		}
		else{
			if (pd(query(1, 1, n, l, r))) puts ("Yes");
			else puts ("No");
		}
	}
	return 0;
}