#include <bits/stdc++.h>
#define LL long long
using namespace std;
bool Med;

int read() {
	int s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

mt19937 rnd(time(NULL));

const int MAXN = 500005, mod = 998244353;

int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1)
			res = (LL)res * a % mod;
		a = (LL)a * a % mod, b >>= 1;
	}
	return res;
}

struct Matrix {
	int a[2][2];
	Matrix() {memset(a, 0, sizeof a);}
	friend Matrix operator * (const Matrix &x, const Matrix &y) {
		Matrix ans;
		ans.a[0][0] = ((LL)x.a[0][0] * y.a[0][0] + (LL)x.a[0][1] * y.a[1][0]) % mod;
		ans.a[0][1] = ((LL)x.a[0][0] * y.a[0][1] + (LL)x.a[0][1] * y.a[1][1]) % mod;
		ans.a[1][0] = ((LL)x.a[1][0] * y.a[0][0] + (LL)x.a[1][1] * y.a[1][0]) % mod;
		ans.a[1][1] = ((LL)x.a[1][0] * y.a[0][1] + (LL)x.a[1][1] * y.a[1][1]) % mod;
		return ans;
	}
	friend bool operator == (const Matrix &x, const Matrix &y) {
		return x.a[0][0] == y.a[0][0] && x.a[0][1] == y.a[0][1] && x.a[1][0] == y.a[1][0] && x.a[1][1] == y.a[1][1];
	}
	void print() {
		cout << a[0][0] << ' ' << a[0][1] << endl << a[1][0] << ' ' << a[1][1] << endl;
	}
} g[3][2], O;

int a[10][10];

bool work(int n) {
	for (int i = 1; i <= n; i++) {
		int mx = i;
		for (int j = i + 1; j <= n; j++)
			if (a[j][i] > a[mx][i])
				mx = j;
		if (!a[mx][i])
			return 0;
		if (mx != i)
			swap(a[mx], a[i]);
		int inv = qpow(a[i][i], mod - 2);
		for (int j = 1; j <= n; j++) {
			if (i == j)
				continue;
			int tmp = (LL)inv * a[j][i] % mod;
			for (int k = i; k <= (n << 1); k++)
				a[j][k] = (a[j][k] - (LL)a[i][k] * tmp % mod + mod) % mod;
		}
		for (int j = 1; j <= (n << 1); j++)
			a[i][j] = (LL)a[i][j] * inv % mod;
	}
	return 1;
}

bool chk(Matrix b) {
	for (int i = 1; i <= 2; i++)
		for (int j = 1; j <= 2; j++)
			a[i][j] = b.a[i - 1][j - 1];
	a[1][3] = 1, a[1][4] = 0, a[2][3] = 0, a[2][4] = 1;
	return work(2);
}

Matrix inv(Matrix b) {
	chk(b);
	Matrix ans;
	ans.a[0][0] = a[1][3], ans.a[0][1] = a[1][4], ans.a[1][0] = a[2][3], ans.a[1][1] = a[2][4];
	return ans;
}

Matrix rnd_mat() {
	Matrix ans;
	for (int i = 0; i < 2; i++)
		for (int j = 0; j < 2; j++)
			ans.a[i][j] = rnd() % mod;
	return ans;
}

Matrix gr() {
	Matrix ans = rnd_mat();
	while (!chk(ans))
		ans = rnd_mat();
	return ans;
}

int n, m;
int s[MAXN];

#define ls (p << 1)
#define rs (p << 1 | 1)
#define mid ((l + r) >> 1)

Matrix sum[MAXN << 2][3];
int tag[MAXN << 2];

void maintain(int p) {
	for (int i = 0; i < 3; i++)
		sum[p][i] = sum[ls][i] * sum[rs][i];
}

void pushtag(int p, int v) {
	for (int i = 1; i <= v; i++)
		swap(sum[p][0], sum[p][2]), swap(sum[p][0], sum[p][1]);
	tag[p] = (tag[p] + v) % 3;
}

void pushdown(int p) {
	if (!tag[p])
		return ;
	pushtag(ls, tag[p]), pushtag(rs, tag[p]), tag[p] = 0;
}

void build(int l, int r, int p) {
	if (l == r) {
		for (int i = 0; i < 3; i++)
			sum[p][i] = g[(s[l] + i) % 3][l & 1];
		return ;
	}
	build(l, mid, ls), build(mid + 1, r, rs);
	maintain(p);
}

void mdf(int l, int r, int p, int x, int y) {
	if (r < x || y < l)
		return ;
	if (x <= l && r <= y) {
		pushtag(p, 1);
		return ;
	}
	pushdown(p);
	mdf(l, mid, ls, x, y), mdf(mid + 1, r, rs, x, y);
	maintain(p);
}

Matrix qry(int l, int r, int p, int x, int y) {
	if (r < x || y < l)
		return O;
	if (x <= l && r <= y)
		return sum[p][0];
	pushdown(p);
	return qry(l, mid, ls, x, y) * qry(mid + 1, r, rs, x, y);
}

bool Mst;
signed main() {
	O.a[0][0] = O.a[1][1] = 1;
	for (int i = 0; i < 3; i++)
		g[i][0] = gr(), g[i][1] = inv(g[i][0]);
	n = read(), m = read();
	for (int i = 1; i <= n; i++)
		scanf("%1d", s + i);
	build(1, n, 1);
	while (m--) {
		int op = read(), l = read(), r = read();
		if (op == 1)
			mdf(1, n, 1, l, r);
		else {
			Matrix ans = qry(1, n, 1, l, r);
			printf(ans == O ? "Yes\n" : "No\n");
		}
	}
	return 0;
}