#include <cstdio>
#include <random>
#include <algorithm>
#define mod 992385479
std::mt19937 rnd((unsigned long long)(new char));
int n, q;
char s[500010];
int qpow(int a, int b) {
	int ans = 1;
	for(; b; a = a * 1ll * a % mod, b >>= 1)
		if (b & 1) ans = ans * 1ll * a % mod;
	return ans;
}
struct Matrix {
	int aa, ab, ba, bb;
	Matrix() {
		aa = rnd() % mod;
		ab = rnd() % mod;
		ba = rnd() % mod;
		bb = (1ll * ab * ba + 1) % mod * qpow(aa, mod - 2) % mod;
	}
	Matrix(int A, int B, int C, int D): aa(A), ab(B), ba(C), bb(D) {}
	const Matrix operator * (const Matrix &rhs) {
		return Matrix(
			(1ll * aa * rhs.aa + 1ll * ab * rhs.ba) % mod,
			(1ll * aa * rhs.ab + 1ll * ab * rhs.bb) % mod,
			(1ll * ba * rhs.aa + 1ll * bb * rhs.ba) % mod,
			(1ll * ba * rhs.ab + 1ll * bb * rhs.bb) % mod
		);
	}
	const Matrix operator ~ () {
		return Matrix(bb, mod - ab, mod - ba, aa);
	}
}Base[6];
struct Node {
	Node *ls, *rs;
	Matrix res[3];
	int tag;
	void pushup() {
		for (int i = 0; i < 3; ++i) 
			res[i] = ls->res[i] * rs->res[i];
	}
	void roll() {
		std::swap(res[0], res[1]), std::swap(res[1], res[2]);
	}
	void rollR() {
		std::swap(res[1], res[2]), std::swap(res[0], res[1]);
	}
	void pushdown() {
		ls->tag = (ls->tag + tag) % 3;
		rs->tag = (rs->tag + tag) % 3;
		if (tag == 1) ls->roll(), rs->roll();
		if (tag == 2) ls->rollR(), rs->rollR();
		tag = 0;
	}
}tr[1000010], *rt, *tcn = tr;
void Build(Node *&u = rt, int l = 1, int r = n) {
	u = tcn++;
	if (l == r) {
		for (int i = 0; i < 3; ++i)
			u->res[i] = Base[(i + s[l] - '0') % 3 + (l % 2? 3: 0)];
		return;
	}
	int mid = (l + r) / 2;
	Build(u->ls, l, mid), Build(u->rs, mid + 1, r);
	u->pushup();
}
void Modify(int tl, int tr, Node *u = rt, int l = 1, int r = n) {
	if (tl <= l && r <= tr) {
		if (++u->tag == 3) u->tag = 0;
		u->roll();
		return;
	}
	u->pushdown();
	int mid = (l + r) / 2;
	if (tl <= mid) Modify(tl, tr, u->ls, l, mid);
	if (tr > mid) Modify(tl, tr, u->rs, mid + 1, r);
	u->pushup();
}
Matrix Query(int tl, int tr, Node *u = rt, int l = 1, int r = n) {
	if (tl <= l && r <= tr) return u->res[0];
	u->pushdown();
	int mid = (l + r) / 2;
	Matrix ans(1, 0, 0, 1);
	if (tl <= mid) ans = Query(tl, tr, u->ls, l, mid);
	if (tr > mid) ans = ans * Query(tl, tr, u->rs, mid + 1, r);
	return ans;
}
int main() {
	scanf("%d%d%s", &n, &q, s + 1);
	for (int i = 0; i < 3; ++i) Base[i + 3] = ~Base[i];
	Build();
	for (int op, l, r; q--; ){
		scanf("%d%d%d", &op, &l, &r);
		if (op == 1) Modify(l, r);
		else {
			Matrix ans = Query(l, r);
			if (ans.aa == 1 && ans.bb == 1 && !ans.ab && !ans.ba) puts("Yes");
			else puts("No");
		}
	}
}