#include <cstdio>
#define rep(i, d, u) for(int i = d; i <= u; ++i)
#define cep(n) while(n--)
int ured() {
	int re = 0;
	char ch;
	do {
		ch = getchar();
	} while('9' < ch || ch < '0');
	do {
		re = re * 10 + (ch ^ '0');
	} while('0' <= (ch = getchar()) && ch <= '9');
	return re;
}
void sred(int *st) {
	int re = 0;
	char ch;
	do {
		ch = getchar();
	} while('2' < ch || ch < '0');
	do {
		st[++re] = ch ^ '0';
	} while('0' <= (ch = getchar()) && ch <= '2');
}
const int _maxn = 500011, _mods = 1000000007;
struct matr {
	int ul, ur, dl, dr;
} ydat[3][2];
void swap(matr &le, matr &ri) {
	matr tp = le;
	le = ri, ri = tp;
}
matr operator*(matr le, matr ri) {
	matr re;
	re . ul = (1ll * le . ul * ri . ul + 1ll * le . ur * ri . dl) % _mods, re . ur = (1ll * le . ul * ri . ur + 1ll * le . ur * ri . dr) % _mods;
	re . dl = (1ll * le . dl * ri . ul + 1ll * le . dr * ri . dl) % _mods, re . dr = (1ll * le . dl * ri . ur + 1ll * le . dr * ri . dr) % _mods;
	return re;
}
struct node {
	int tn;
	matr da[3][8];
} tree[_maxn << 2], rans;
node operator+(node le, node ri) {
	node re;
	re . tn = le . tn ^ ri . tn;
	rep(i, 0, 2) {
		int to = (le . tn << i | le . tn >> 3 - i) & 7;
		rep(j, 0, 7) {
			re . da[i][j] = le . da[i][j] * ri . da[i][j ^ to];
		}
	}
	return re;
}
int lazy[_maxn << 2];
void addt(int at, int da) {
	tree[at] . tn = (tree[at] . tn << da | tree[at] . tn >> 3 - da) & 7;
	if(da == 2) {
		rep(i, 0, 7) {
			swap(tree[at] . da[2][i], tree[at] . da[1][i]), swap(tree[at] . da[1][i], tree[at] . da[0][i]);
		}
	} else {
		rep(i, 0, 7) {
			swap(tree[at] . da[0][i], tree[at] . da[1][i]), swap(tree[at] . da[1][i], tree[at] . da[2][i]);
		}
	}
	if((lazy[at] += da) >= 3) {
		lazy[at] -= 3;
	}
}
void push(int at) {
	if(lazy[at]) {
		addt(at << 1, lazy[at]), addt(at << 1 | 1, lazy[at]), lazy[at] = 0;
	}
}
void modi(int at, int le, int ri, int ql, int qr) {
	if(ql <= le && ri <= qr) {
		addt(at, 1);
	} else {
		push(at);
		if(ql <= le + ri >> 1) {
			modi(at << 1, le, le + ri >> 1, ql, qr);
		}
		if(qr > le + ri >> 1) {
			modi(at << 1 | 1, (le + ri >> 1) + 1, ri, ql, qr);
		}
		tree[at] = tree[at << 1] + tree[at << 1 | 1];
	}
}
node quer(int at, int le, int ri, int ql, int qr) {
	if(ql <= le && ri <= qr) {
		return tree[at];
	} else {
		push(at);
		if(ql <= le + ri >> 1 && qr > le + ri >> 1) {
			return quer(at << 1, le, le + ri >> 1, ql, qr) + quer(at << 1 | 1, (le + ri >> 1) + 1, ri, ql, qr);
		} else if(ql <= le + ri >> 1) {
			return quer(at << 1, le, le + ri >> 1, ql, qr);
		} else {
			return quer(at << 1 | 1, (le + ri >> 1) + 1, ri, ql, qr);
		}
	}
}
int n, m, s[_maxn], o, l, r;
void buil(int at, int le, int ri) {
	if(le == ri) {
		tree[at] . tn = 1 << s[le];
		rep(i, 0, 2) {
			int to = i + s[le];
			if(to >= 3) {
				to -= 3;
			}
			rep(j, 0, 7) {
				tree[at] . da[i][j] = ydat[to][j >> to & 1];
			}
		}
	} else {
		buil(at << 1, le, le + ri >> 1), buil(at << 1 | 1, (le + ri >> 1) + 1, ri), tree[at] = tree[at << 1] + tree[at << 1 | 1];
	}
}
int main() {
	ydat[0][0] . ul = 412919480, ydat[0][0] . ur = 817180586, ydat[0][0] . dl = 778478905, ydat[0][0] . dr = 606534254;
	ydat[0][1] . ul = 212546852, ydat[0][1] . ur = 800055361, ydat[0][1] . dl = 389902873, ydat[0][1] . dr = 414339502;
	ydat[1][0] . ul = 142263219, ydat[1][0] . ur = 281120604, ydat[1][0] . dl = 952352869, ydat[1][0] . dr = 593411080;
	ydat[1][1] . ul = 967492096, ydat[1][1] . ur = 855199325, ydat[1][1] . dl = 799121190, ydat[1][1] . dr = 183231071;
	ydat[2][0] . ul = 810917879, ydat[2][0] . ur = 259899856, ydat[2][0] . dl = 861642819, ydat[2][0] . dr = 940963655;
	ydat[2][1] . ul = 959940905, ydat[2][1] . ur = 769279063, ydat[2][1] . dl = 658335409, ydat[2][1] . dr = 932747677;
	n = ured(), m = ured(), sred(s), buil(1, 1, n);
	cep(m) {
		o = ured(), l = ured(), r = ured();
		if(o == 1) {
			modi(1, 1, n, l, r);
		} else {
			rans = quer(1, 1, n, l, r);
			if(rans . da[0][0] . ul == rans . da[0][0] . dr && rans . da[0][0] . ul == 1 &&
			rans . da[0][0] . ur == rans . da[0][0] . dl && !rans . da[0][0] . ur) {
				puts("Yes");
			} else {
				puts("No");
			}
		}
	}
	return 0;
}