//trick：如果有一个东西，满足交换律但不满足结合律，那么可以维护矩阵
//trick：构造自逆矩阵 https://blog.csdn.net/max20090810/article/details/131800788
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 5e5 + 5, mod = 998244353;
int qpow(int x, int y) {int ans = 1; while (y) {if (y & 1) ans = 1ll * ans * x % mod; x = 1ll * x * x % mod; y >>= 1;} return ans;}
struct Matrix {
	int a[2][2];
	Matrix(int q = 0, int e = 0, int r = 0, int t = 0) {a[0][0] = q, a[0][1] = e, a[1][0] = r, a[1][1] = t;}
	friend Matrix operator + (Matrix p, Matrix q)
	{
		Matrix X;
		for (int i : {0, 1}) for (int j : {0, 1}) for (int k : {0, 1}) X.a[i][j] = (X.a[i][j] + 1ll * p.a[i][k] * q.a[k][j] % mod) % mod;
		return X;
	}
	friend bool operator == (Matrix p, Matrix q) {for (int i : {0, 1}) for (int j : {0, 1}) if (p.a[i][j] != q.a[i][j]) return false; return true;}
} mat[3], I;
Matrix generator(long long a, long long b) {return {int(a % mod), int(b % mod), int(((1 - a * a % mod) * qpow(b, mod - 2) % mod + mod) % mod), int(mod - a)};}
namespace SegmentTree {
	#define ls pos << 1
	#define rs pos << 1 | 1

	Matrix tr[N << 2][3]; int move[N << 2];
	void pushup(int pos) {for (int i : {0, 1, 2}) tr[pos][i] = tr[ls][i] + tr[rs][i];}
	void build(int l, int r, int pos)
	{
		if (l == r)
		{
			int p; scanf("%1d", &p);
			for (int i : {0, 1, 2}) tr[pos][i] = mat[(p + i) % 3];
			return;
		}
		int mid = (l + r) >> 1;
		build(l, mid, ls), build(mid + 1, r, rs), pushup(pos);
	}
	void lazy(int pos) //[0,1,2]==>[1,2,0]
		{(move[pos] += 1) %= 3; swap(tr[pos][0], tr[pos][1]), swap(tr[pos][1], tr[pos][2]);}
	void pushdown(int pos) //平移 move[pos] 次
	{
		for (int i = 1; i <= move[pos]; i++) lazy(ls), lazy(rs);
		move[pos] = 0;
	}
	void update(int l, int r, int pos, int L, int R)
	{
		if (L <= l && r <= R) return lazy(pos);
		pushdown(pos); int mid = (l + r) >> 1;
		if (L <= mid) update(l, mid, ls, L, R);
		if (mid < R) update(mid + 1, r, rs, L, R);
		pushup(pos);
	}
	Matrix query(int l, int r, int pos, int L, int R)
	{
		if (L <= l && r <= R) return tr[pos][0];
		pushdown(pos); int mid = (l + r) >> 1; Matrix ans = I;
		if (L <= mid) ans = ans + query(l, mid, ls, L, R);
		if (mid < R) ans = ans + query(mid + 1, r, rs, L, R);
		return ans;
	}

	#undef ls
	#undef rs
} using namespace SegmentTree;
int main()
{
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	I = {1, 0, 0, 1};
	mat[0] = generator(114514, 1919810);
	mat[1] = generator(641641, 3841);
	mat[2] = generator(847847, 1245);

	int n, q;
	scanf("%d%d", &n, &q), build(1, n, 1);
	while (q--)
	{
		int op, l, r;
		scanf("%d%d%d", &op, &l, &r);
		if (op == 1) update(1, n, 1, l, r);
		else puts(query(1, n, 1, l, r) == I ? "Yes" : "No");
	}
	return 0;
}