// Author: kyEEcccccc

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using ULL = unsigned long long;

#define F(i, l, r) for (int i = (l); i <= (r); ++i)
#define FF(i, r, l) for (int i = (r); i >= (l); --i)
#define MAX(a, b) ((a) = max(a, b))
#define MIN(a, b) ((a) = min(a, b))
#define SZ(a) ((int)((a).size()) - 1)

constexpr int N = 500005, M = 2, MOD = 998244353;

mt19937 ran(chrono::system_clock::now().time_since_epoch().count());
uniform_int_distribution<int> gen(1, MOD - 1);

LL kpow(LL x, LL k = MOD - 2)
{
	LL r = 1;
	while (k)
	{
		if (k & 1) r = r * x % MOD;
		x = x * x % MOD;
		k >>= 1;
	}
	return r;
}

struct Mat
{
	int a[M][M];

	Mat operator *(const Mat& o)
	{
		Mat res;
		memset(res.a, 0, sizeof (res.a));
		F(i, 0, M - 1) F(k, 0, M - 1)
		{
			if (a[i][k] == 0) continue;
			F(j, 0, M - 1) res.a[i][j] = (res.a[i][j] + (LL)a[i][k] * o.a[k][j]) % MOD;
		}
		return res;
	}
} bs[3][2];

pair<Mat, bool> calc_inv(Mat x)
{
	Mat y;
	F(i, 0, M - 1) F(j, 0, M - 1) y.a[i][j] = i == j ? 1 : 0;
	F(i, 0, M - 1)
	{
		F(j, i, M - 1)
		{
			if (x.a[j][i] != 0)
			{
				if (j != i) swap(x.a[i], x.a[j]), swap(y.a[i], y.a[j]);
				break;
			}
		}
		if (x.a[i][i] == 0) return {y, false};
		LL iv = kpow(x.a[i][i]);
		F(j, 0, M - 1) x.a[i][j] = iv * x.a[i][j] % MOD, y.a[i][j] = iv * y.a[i][j] % MOD;
		F(j, 0, M - 1)
		{
			if (j == i) continue;
			LL t = x.a[j][i];
			F(k, 0, M - 1)
			{
				x.a[j][k] = (x.a[j][k] - x.a[i][k] * t) % MOD;
				y.a[j][k] = (y.a[j][k] - y.a[i][k] * t) % MOD;
			}
		}
	}
	F(i, 0, M - 1) F(j, 0, M - 1) (y.a[i][j] += MOD) %= MOD;
	return {y, true};
}

pair<Mat, Mat> calc_mat_inv(void)
{
	while (1)
	{
		Mat x;
		F(i, 0, M - 1) F(j, 0, M - 1) x.a[i][j] = gen(ran);
		auto res = calc_inv(x);
		if (res.second) return {x, res.first};
	}
}

int n;
string str;

struct SegT
{
	Mat pd[N << 2][3];
	int tg[N << 2];

	void init(int p, int cl, int cr)
	{
		tg[p] = 0;
		if (cl == cr)
		{
			int t = str[cl - 1] - '0';
			F(i, 0, 2) pd[p][i] = bs[(t + i) % 3][cl % 2];
			return;
		}
		int cm = (cl + cr) >> 1;
		init(p << 1, cl, cm), init(p << 1 | 1, cm + 1, cr);
		F(i, 0, 2) pd[p][i] = pd[p << 1][i] * pd[p << 1 | 1][i];
	}

	void modi(int p, int t)
	{
		(tg[p] += t) %= 3;
		Mat tmp[3];
		F(i, 0, 2) tmp[i] = pd[p][(i + t) % 3];
		F(i, 0, 2) pd[p][i] = tmp[i];
	}

	void pushdown(int p)
	{
		if (tg[p] == 0) return;
		modi(p << 1, tg[p]);
		modi(p << 1 | 1, tg[p]);
		tg[p] = 0;
	}

	Mat get_product(int p, int cl, int cr, int l, int r)
	{
		if (cl >= l && cr <= r) return pd[p][0];
		pushdown(p);
		int cm = (cl + cr) >> 1;
		if (l <= cm && r > cm)
		{
			return get_product(p << 1, cl, cm, l, r)
				* get_product(p << 1 | 1, cm + 1, cr, l, r);
		}
		else if (l <= cm) return get_product(p << 1, cl, cm, l, r);
		else return get_product(p << 1 | 1, cm + 1, cr, l, r);
	}

	void add(int p, int cl, int cr, int l, int r)
	{
		if (cl >= l && cr <= r) return modi(p, 1);
		pushdown(p);
		int cm = (cl + cr) >> 1;
		if (l <= cm) add(p << 1, cl, cm, l, r);
		if (r > cm) add(p << 1 | 1, cm + 1, cr, l, r);
		F(i, 0, 2) pd[p][i] = pd[p << 1][i] * pd[p << 1 | 1][i];
	}
} sgt;

signed main(void)
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0), cin.tie(nullptr);

	F(i, 0, 2)
	{
		auto res = calc_mat_inv();
		bs[i][0] = res.first, bs[i][1] = res.second;

		// auto x = bs[i][0] * bs[i][1];
		// bool ok = true;
		// F(i, 0, M - 1) F(j, 0, M - 1)
		// 	if (x.a[i][j] != (i == j ? 1 : 0)) ok = false;
		// assert(ok);
	}

	int q; cin >> n >> q;
	cin >> str;

	sgt.init(1, 1, n);

	while (q--)
	{
		int op, l, r; cin >> op >> l >> r;
		if (op == 1) sgt.add(1, 1, n, l, r);
		else
		{
			auto res = sgt.get_product(1, 1, n, l, r);
			bool ok = true;
			F(i, 0, M - 1) F(j, 0, M - 1)
				if (res.a[i][j] != (i == j ? 1 : 0)) ok = false;
			if (ok) cout << "Yes\n"; else cout << "No\n";
		}
	}
	
	return 0;
}