#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define fi first
#define se second
#define Mp make_pair
using namespace std;
typedef long long ll;
int rd() {
	int r=0; bool w=false; char ch=getchar();
	while( ch < '0' || ch > '9' ) w = !(ch^45), ch = getchar();
	while( ch >= '0' && ch <= '9' ) r = (r<<1) + (r<<3) + (ch^48), ch = getchar();
	return w ? -r : r;
}
const int mod = 998244353;

int quick_pow( int a , int p ) {
	int ret = 1;
	for(;p;p>>=1) {
		if( p&1 ) ret = (ll) a * ret % mod;
		a = (ll) a * a % mod;
	}
	return ret;
}
int inv( int a ) {
	return quick_pow(a,mod-2);
}

struct Matrix{
	int a00, a01, a10, a11;
	Matrix(){ a00 = a01 = a10 = a11 = 0; }
	Matrix(int A00, int A01, int A10, int A11){a00=A00, a01=A01, a10=A10, a11=A11;}
	Matrix(int A) { a00 = (rand()%mod+mod)%mod, a01 = (rand()%mod+mod)%mod, a10 = (rand()%mod+mod)%mod, a11 = (rand()%mod+mod)%mod; }
	Matrix operator *(const Matrix &b) const {
		Matrix ret(((ll)a00*b.a00 + (ll)a01*b.a10)%mod, ((ll)a00*b.a01 + (ll)a01*b.a11)%mod, ((ll)a10*b.a00 + (ll)a11*b.a10)%mod, ((ll)a10*b.a01 + (ll)a11*b.a11)%mod);
		return ret;
	}
	bool operator ==(const Matrix &a) const {
		return a00 == a.a00 && a01 == a.a01 && a10 == a.a10 && a11 == a.a11;
	}
}M1, M2, M0, _M1, _M2, _M0, eM(1,0,0,1);
void mul( int &a , int b ) {
	a = (ll) a * b % mod;
}
Matrix invM( Matrix &a ) {
	Matrix ret(a.a11, (mod-a.a01)%mod, (mod-a.a10)%mod, a.a00);
	int i = inv((((ll)a.a00*a.a11 - (ll)a.a10*a.a01)%mod+mod)%mod);
	mul(ret.a00, i), mul(ret.a01,i), mul(ret.a10, i), mul(ret.a11, i);
	return ret;
}
void init() {
	M0 = Matrix(1), M1 = Matrix(1), M2 = Matrix(2);
	_M0 = invM(M0), _M1 = invM(M1), _M2 = invM(M2);
	Matrix ts = M0 * _M0;
//	printf("%d %d %d %d", ts.a00, ts.a01, ts.a10, ts.a11);
}

#define MAXN 500000
int n,q, s[MAXN+5]; char str[MAXN+5];
int tag[MAXN*4+5], lz[MAXN*4+5];
Matrix mt[MAXN*4+5][3];
#define lson (p<<1)
#define rson ((p<<1)+1)
Matrix oMat( int x , int i ) {
	return x == 0 ? (i%2?M0:_M0) : x == 1 ? (i%2?M1:_M1) : (i%2?M2:_M2);
}
void pushdown( int p ) {
	if( lz[p] ) {
		tag[lson] = (tag[lson]+lz[p])%3, lz[lson] = (lz[lson]+lz[p])%3;
		tag[rson] = (tag[rson]+lz[p])%3, lz[rson] = (lz[rson]+lz[p])%3;
		lz[p] = 0;
	}
}
void pushup( int p ) {
	FOR(i,0,2) mt[p][i] = mt[lson][(i+tag[lson]-tag[p]+3)%3] * mt[rson][(i+tag[rson]-tag[p]+3)%3];
}
void build( int p , int L = 1, int R = n ) {
	if( L == R ) {
		FOR(i,0,2) mt[p][i] = oMat((s[L]+i)%3,L);
		return;
	}
	int mid = L+R>>1;
	build(lson,L,mid), build(rson,mid+1,R);
	pushup(p);
}
void update( int p , int l , int r , int L=1 , int R=n ) {
	if( L == l && R == r ) {
		tag[p] = (tag[p]+1)%3;
		lz[p] = (lz[p]+1)%3;
		return;
	}
	pushdown(p);
	int mid = L+R>>1;
	if( r <= mid ) update(lson,l,r,L,mid);
	else if( l > mid ) update(rson,l,r,mid+1,R);
	else update(lson,l,mid,L,mid),
		update(rson,mid+1,r,mid+1,R);
	pushup(p);
}
Matrix query( int p , int l , int r , int L=1 , int R=n ) {
	if( L == l && R == r )
		return mt[p][tag[p]];
	pushdown(p);
	int mid = L+R>>1;
	if( r <= mid ) return query(lson,l,r,L,mid);
	if( l > mid ) return query(rson,l,r,mid+1,R);
	return query(lson,l,mid,L,mid) * query(rson,mid+1,r,mid+1,R);
}
#undef lson
#undef rson

int main() {
	srand(time(0));
	init();
	n = rd(), q = rd();
	scanf("%s",str+1); FOR(i,1,n) s[i] = str[i] - '0';
	build(1);
	FOR(i,1,q) {
		int opt = rd(), l = rd(), r = rd();
		if( opt == 1 ) update(1,l,r);
		else puts(query(1,l,r) == eM ? "YES" : "NO");
	} 
	return 0;
}