#include<bits/stdc++.h>
#define ll long long
const int mod = 998244353,N = 5e5;
using namespace std;
int n, t, l, r, opt;
int v[N + 10];
char a;
inline ll mpow(ll x,int k){
	ll ans = 1;
	while(k){
		if(k & 1) ans = ans * x % mod;
		k >>= 1;
		x = x * x % mod;
	}	
	return ans;
}
struct Mar{
	ll a[2][2];
	void print()const{
		for(int i = 0; i <= 1; ++i){
			for(int j = 0; j <= 1; ++j){
				cout<<a[i][j]<<' ';
			}
			cout<<'\n';
		}
	}
	inline Mar operator *(const Mar b)const{
		Mar c;
		for(int i = 0; i <= 1; ++i){
			for(int j = 0; j <= 1; ++j){
				c.a[i][j] = 0;
				for(int k = 0; k <= 1; ++k){
					c.a[i][j] += a[i][k] * b.a[k][j] % mod; 
				}
				c.a[i][j] %= mod;
			}
		}
		return c;
	}
	inline Mar inv()const{
		Mar b,c;
		c.a[0][0] = 1;c.a[0][1] = 0;
		c.a[1][0] = 0;c.a[1][1] = 1;
		for(int i = 0; i <= 1; ++i) for(int j = 0;j <= 1; ++j) b.a[i][j] = a[i][j];
		for(int i = 0; i <= 1; ++i){
			for(int j = 0;j <= 1; ++j){
				if(i == j) continue;
				ll w = b.a[j][i] * mpow(b.a[i][i], mod - 2) % mod;
				for(int k = 0;k <= 1; ++k){
					b.a[j][k] = (b.a[j][k] - b.a[i][k] * w % mod + mod) % mod;
					c.a[j][k] = (c.a[j][k] - c.a[i][k] * w % mod + mod) % mod;
				}
			}
		}
		for(int i = 0;i <= 1; ++i){
			for(int j = 0;j <= 1; ++j){
				c.a[i][j] = c.a[i][j] * mpow(b.a[i][i],mod - 2) % mod;
			}
		}
		return c;
	}
	
}m[3],m_[3],ans;
inline void pre(){
	m[0].a[0][0] = 2,m[0].a[0][1] = 3;
	m[0].a[1][0] = 5,m[0].a[1][1] = 7;
	m[1].a[0][0] = 11,m[1].a[0][1] = 13;
	m[1].a[1][0] = 17,m[1].a[1][1] = 19;
	m[2].a[0][0] = 23,m[2].a[0][1] = 29;
	m[2].a[1][0] = 31,m[2].a[1][1] = 37;
	m_[0] = m[0].inv();
	m_[1] = m[1].inv();
	m_[2] = m[2].inv();
}
struct node{
	int tag;
	Mar now,nxt,nnt;
}tr[19 * N];
inline void update(int x){
	tr[x].now = tr[x << 1].now * tr[x << 1 | 1].now;
	tr[x].nxt = tr[x << 1].nxt * tr[x << 1 | 1].nxt;
	tr[x].nnt = tr[x << 1].nnt * tr[x << 1 | 1].nnt;
}
inline void adtr(int x){
	swap(tr[x].now,tr[x].nnt);
	swap(tr[x].now,tr[x].nxt);
}
inline void pushdown(int x){
	tr[x << 1].tag = (tr[x << 1].tag + tr[x].tag) % 3;
	tr[x << 1 | 1].tag = (tr[x << 1 | 1].tag + tr[x].tag) % 3;
	while(tr[x].tag > 0){
		adtr(x << 1);
		adtr(x << 1 | 1);
		--tr[x].tag;
	}
	return ;
}
inline void build(int x,int l,int r){
	if(l == r){
		 // cout<<x;
		if(l % 2){
			tr[x].now = m_[v[l]];
			tr[x].nxt = m_[(v[l] + 1) % 3];
			tr[x].nnt = m_[(v[l] + 2) % 3];
		}else{
			// m[v[l]].print();
			tr[x].now = m[v[l]];
			tr[x].nxt = m[(v[l] + 1) % 3];
			tr[x].nnt = m[(v[l] + 2) % 3];
		}	
		tr[x].tag = 0;
		return ;
	}
	int mid = (l + r) >> 1;
	build(x << 1, l, mid);
	build(x << 1 | 1, mid + 1, r);
	update(x);
}
inline void add(int x,int l,int r,int L,int R){
	if(L <= l && r <= R){
		++tr[x].tag;
		adtr(x);
		return ;
	}
	pushdown(x);
	int mid = (l + r) >> 1;
	if(mid >= L)add(x << 1, l, mid, L, R);
	if(mid < R )add(x << 1 | 1, mid + 1, r, L, R);
	update(x);
}
inline Mar query(int x,int l,int r,int L,int R){
	if(L <= l && r <= R){
		// cout<<x<<'\n';
		// tr[x].now.print();
		return tr[x].now;
	}	
	Mar c;
	c.a[0][0] = 1;c.a[0][1] = 0;
	c.a[1][0] = 0;c.a[1][1] = 1;
	pushdown(x);
	int mid = (l + r) >> 1;
	if(mid >= L)c = c * query(x << 1, l, mid, L, R);
	if(mid < R)c = c * query(x << 1 | 1, mid + 1, r, L, R);
	return c;
}
void input(){
	cin>>n>>t;
	for(int i = 1; i <= n; ++i){
		cin>>a;
		v[i] = a - '0';
	}
	build(1,1,n);
}
void op(){
	while(t--){	
		cin>>opt>>l>>r;
		if(opt == 1){
			add(1,1,n,l,r);
		}else if(opt == 2){
			ans = query(1,1,n,l,r);
			// ans.print();
			if(ans.a[0][0] == 1 && ans.a[0][1] == 0 && ans.a[1][0] == 0 && ans.a[1][1] == 1){
				cout<<"YES"<<'\n';
			}else{
				cout<<"NO"<<'\n';
			}
		}
	}
}
int main(){
	cin.tie(0)->sync_with_stdio(false);
	pre();
	input();
	op();

}