// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int mod = 1e9 + 7, N = 5e5;
struct mat {
	int n, m, s[3][3];
	mat (int _n = 0, int _m = 0) {n = _n, m = _m, memset(s, 0, sizeof(s));}
	void init(int _n, int _m) {
		n = _n, m = _m;
		memset(s, 0, sizeof(s));
	}
	mat operator*(const mat &o) const {
		mat res(n, o.m);
		rep(k, 0, m - 1) rep(i, 0, n - 1) rep(j, 0, o.m - 1)
		(res.s[i][j] += s[i][k] * o.s[k][j] % mod) %= mod;
		return res;
	}
	int* operator[](const int &n) {return s[n];}
	void print() {rep(i, 0, n - 1) rep(j, 0, m - 1) cerr << s[i][j] << " \n"[j == m - 1];}
} A[2][3], w[N * 4 + 5][3];

int a, b, lzy[N * 4 + 5];
char s[N + 5];
mat get(vi n) {
	mat res(3, 3);
	res[0][0] = n[0], res[0][1] = n[1], res[0][2] = n[2];
	res[1][0] = n[3], res[1][1] = n[4], res[1][2] = n[5];
	res[2][0] = n[6], res[2][1] = n[7], res[2][2] = n[8];
	return res;
}
#define ls n << 1
#define rs n << 1 | 1
void up(int n) {
	w[n][0] = w[ls][0] * w[rs][0];
	w[n][1] = w[ls][1] * w[rs][1];
	w[n][2] = w[ls][2] * w[rs][2];
}
void upd(int n) {
	// cerr << "#@@" << endl;
	(++lzy[n]) %= 3;
	swap(w[n][0], w[n][1]);
	swap(w[n][1], w[n][2]);
}
void dw(int n) {
	// cerr << n << ' ' << lzy[n] << endl;
	while(lzy[n]) upd(ls), upd(rs), --lzy[n];
}
void build(int n, int l, int r) {
	if(l == r) {
		w[n][0] = A[l & 1][s[l] - '0'];
		w[n][1] = A[l & 1][(s[l] - '0' + 1) % 3];
		w[n][2] = A[l & 1][(s[l] - '0' + 2) % 3];
		return;
	}
	int mid = (l + r) >> 1;
	build(ls, l, mid), build(rs, mid + 1, r);
	up(n);
}
void add(int n, int l, int r, int L, int R) {
	if(l >= L && r <= R) return upd(n);
	dw(n);
	int mid = (l + r) >> 1;
	if(L <= mid) add(ls, l, mid, L, R);
	if(mid < R) add(rs, mid + 1, r, L, R);
	up(n);
}
mat ask(int n, int l, int r, int L, int R) {
	if(l >= L && r <= R) return w[n][0];
	// cout << l << ' ' << r << endl;
	dw(n);
	int mid = (l + r) >> 1;
	if(R <= mid) return ask(ls, l, mid, L, R);
	if(mid < L) return ask(rs, mid + 1, r, L, R);
	return ask(ls, l, mid, L, R) * ask(rs, mid + 1, r, L, R);
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	A[0][0] = get(vi{408816132,624501901,863873309,9310094,86627966,89888563,14494264,132407065,443379406});
	A[1][0] = get(vi{202813438,814755261,345329874,31225951,511313091,453949833,863441212,393703963,448708478});
	A[0][1] = get(vi{453265461,976029702,310341510,294136539,992478427,472149856,967403790,623266520,628200498});
	A[1][1] = get(vi{980666758,839192405,522754128,436588278,125368905,676418936,425903383,303146820,612798959});
	A[0][2] = get(vi{757203266,371375308,181518691,164479689,219929693,320481324,500438191,340601498,615806927});
	A[1][2] = get(vi{859498949,948085882,399843276,621954902,466226813,92811933,167410307,227745494,66160954});
	cin >> a >> b >> s + 1;
	build(1, 1, a);
	int o, x, y;
	rep(i, 1, b) {
		// cerr << i << endl;
		cin >> o >> x >> y;
		if(o == 1) add(1, 1, a, x, y);
		else {
			mat res = ask(1, 1, a, x, y);
			!!res[0][0] && !!res[1][1] && !res[1][0] && !res[0][1] ? cout << "Yes\n" : cout << "No\n";
		}
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}