#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 5e5 + 5, mod = 1e9 + 7;
int n, q, ans, c[N];
char s[N];

ll qmi(ll x, int y){
	ll res = 1ll;
	for(; y; y >>= 1, x = x * x % mod)if(y & 1)res = res * x % mod;
	return res;
}

struct Matrix{
	ll a[2][2];
	Matrix operator * (const Matrix rhs){
		Matrix res; memset(res.a, 0, sizeof res.a);
		for(int i = 0; i < 2; ++i)
			for(int j = 0; j < 2; ++j)
				for(int k = 0; k < 2; ++k){
					res.a[i][j] += a[i][k] * rhs.a[k][j] % mod;
					res.a[i][j] %= mod;
				}
		return res;
	}
	void INIT(){
		a[0][0] = 1; a[0][1] = 0; a[1][0] = 0; a[1][1] = 1;
	}
	void out(){
		for(int i = 0; i < 2; ++i)cout << a[i][0] << ' ' << a[i][1] << '\n';
		cout << '\n';
	}
}A[3];
void init(){
	A[0] = {54181845, 18455418, 711016233, 945818162};
	A[1] = {18451845, 54185418, 59868606, 981548162};
	A[2] = {11451419, 41919810, 110559543, 988548588};
}

void test(){
	Matrix ans1 = A[0] * A[0], ans2 = A[1] * A[1], ans3 = A[2] * A[2];
	ans1.out(); ans2.out(); ans3.out();
}

int tg[N << 2];
struct tree{
	#define ls x << 1
	#define rs x << 1 | 1

	Matrix t[N << 2][3];
}tt;
void upd(int x){
	for(int i = 0; i < 3; ++i)tt.t[x][i] = tt.t[ls][i] * tt.t[rs][i];
}
void build(int x, int l, int r){
	if(l == r){
		for(int i = 0; i < 3; ++i)tt.t[x][i] = A[(c[l] + i) % 3];
		return;
	}
	int mid = l + r >> 1;
	build(ls, l, mid); build(rs, mid + 1, r);
	upd(x);
}

void trans(int x){
	swap(tt.t[x][0], tt.t[x][1]);
	swap(tt.t[x][1], tt.t[x][2]);
}
void pushdown(int x){
	if(! tg[x])return;
	for(int i = 0; i < tg[x]; ++i)trans(ls), trans(rs);
	tg[ls] += tg[x]; tg[ls] %= 3;
	tg[rs] += tg[x]; tg[rs] %= 3;
	tg[x] = 0;
}

void modify(int x, int l, int r, int L, int R){
	if(L <= l and r <= R){
		++tg[x], tg[x] %= 3, trans(x);
		return;
	}
	int mid = l + r >> 1;
	pushdown(x);
	if(L <= mid)modify(ls, l, mid, L, R);
	if(mid < R)modify(rs, mid + 1, r, L, R);
	upd(x);
}
Matrix query(int x, int l, int r, int L, int R){
	if(L <= l and r <= R)return tt.t[x][0];
	int mid = l + r >> 1;
	Matrix res; res.INIT(); pushdown(x);
	if(L <= mid)res = query(ls, l, mid, L, R);
	if(mid < R)res = res * query(rs, mid + 1, r, L, R);
	return res;
}

bool chk(int l, int r){
	Matrix res = query(1, 1, n, l, r);
	return res.a[0][0] == 1 and res.a[0][1] == 0 and res.a[1][0] == 0 and res.a[1][1] == 1;
}

signed main(){
//	freopen("doog.in", "r", stdin);
//	freopen("doog.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
//	ll a, b; cin >> a >> b;
//	cout << (1 + mod - a * a % mod) * qmi(b, mod - 2) % mod << ' ' << mod - a << '\n';
	init();
//	test();
	cin >> n >> q;
	cin >> s + 1;
	for(int i = 1; i <= n; ++i)c[i] = s[i] - '0';
	build(1, 1, n);
	while(q--){
		int opt, l, r;
		cin >> opt >> l >> r;
		if(opt == 1)modify(1, 1, n, l, r);
		else cout << (chk(l, r) ? "YES" : "NO") << '\n';
	}
	return 0;
}
/*
8 9
01211012
2 4 5
2 3 6
1 6 8
1 6 8
2 3 6
2 1 8
1 1 1
1 7 7
2 1 8

*/