#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5,MOD = 998244353;
struct Matrix{
	int a[2][2];
};
struct Tree{
	Matrix val[3];
	int tag;
}t[N * 4];
const Matrix ss[3] = { {{{1,2} , {3,4}}} , {{{114,514} , {1919,810}}} , {{{1926,817} , {1905,411}}} };
const Matrix rv[3] = { {{{998244351,1} , {499122178,499122176}}} , {{{552026472,729284502} , {252393273,587906395}}} , {{{650701368,90939814} , {583484246,273132699}}} };
int n,q;
char rd[N];
Matrix operator *(Matrix x,Matrix y)
{
	Matrix z;
	memset(z.a,0,sizeof(z.a));
	z.a[0][0] = (1ll * x.a[0][1] * y.a[1][0] + 1ll * x.a[0][0] * y.a[0][0] % MOD) % MOD;
	z.a[0][1] = (1ll * x.a[0][1] * y.a[1][1] + 1ll * x.a[0][0] * y.a[0][1] % MOD) % MOD;
	z.a[1][0] = (1ll * x.a[1][1] * y.a[1][0] + 1ll * x.a[1][0] * y.a[0][0] % MOD) % MOD;
	z.a[1][1] = (1ll * x.a[1][1] * y.a[1][1] + 1ll * x.a[1][0] * y.a[0][1] % MOD) % MOD;
	return z;
}
inline void pushup(int pos)
{
	for(int i = 0;i <= 2;i++) t[pos].val[i] = t[pos << 1].val[i] * t[pos << 1 | 1].val[i];
}
inline void build(int l,int r,int pos)
{
	if(l == r)
	{
		if(l & 1) t[pos].val[0] = ss[rd[l] - '0'],t[pos].val[1] = ss[(rd[l] - '0' + 1) % 3],t[pos].val[2] = ss[(rd[l] - '0' + 2) % 3];
		else t[pos].val[0] = rv[rd[l] - '0'],t[pos].val[1] = rv[(rd[l] - '0' + 1) % 3],t[pos].val[2] = rv[(rd[l] - '0' + 2) % 3];
		return;
	}
	int mid = (l + r) >> 1;
	build(l,mid,pos << 1);
	build(mid + 1,r,pos << 1 | 1);
	pushup(pos);
}
inline void change(int pos)
{
	swap(t[pos].val[0],t[pos].val[1]);
	swap(t[pos].val[1],t[pos].val[2]); 
}
inline void pushdown(int pos)
{
	for(int i = 1;i <= t[pos].tag;i++) change(pos << 1),change(pos << 1 | 1);
	t[pos << 1].tag = (t[pos << 1].tag + t[pos].tag) % 3;
	t[pos << 1 | 1].tag = (t[pos << 1 | 1].tag + t[pos].tag) % 3;
	t[pos].tag = 0;
}
inline void modify(int l,int r,int L,int R,int pos)
{
	if(L <= l && r <= R)
	{
		change(pos);
		t[pos].tag = (t[pos].tag + 1) % 3;
		return;
	}
	pushdown(pos);
	int mid = (l + r) >> 1;
	if(L <= mid) modify(l,mid,L,R,pos << 1);
	if(R > mid) modify(mid + 1,r,L,R,pos << 1 | 1);
	pushup(pos); 
}
inline Matrix query(int l,int r,int L,int R,int pos)
{
	if(L <= l && r <= R) return t[pos].val[0];
	pushdown(pos);
	int mid = (l + r) >> 1;
	Matrix ret;ret.a[0][0] = 1;ret.a[1][1] = 1;ret.a[1][0] = 0;ret.a[0][1] = 0;
	if(L <= mid) ret = ret * query(l,mid,L,R,pos << 1);
	if(R > mid) ret = ret * query(mid + 1,r,L,R,pos << 1 | 1);
	pushup(pos);
	return ret;
}
inline bool ok(Matrix x)
{
	return (x.a[0][0] == 1) && (x.a[1][1] == 1) && (x.a[1][0] == 0) && (x.a[0][1] == 0);
}
inline int read()
{
	int s = 0;
	char k = getchar();
	while(k > '9' || k < '0') k = getchar();
	while(k <= '9' && k >= '0')
	{
		s = s * 10 + k - '0';
		k = getchar();
	}
	return s;
}
int main()
{
	n = read();q = read();
	scanf("%s",rd + 1);
	build(1,n,1);
	int l,r,op;
	for(register int i = 1;i <= q;i++)
	{
		op = read();l = read();r = read();
		if(l > r) swap(l,r);
		if(op == 1)
			modify(1,n,l,r,1);
		else
		{
			if(ok(query(1,n,l,r,1))) puts("YES");
			else puts("NO");
		}
	}
	return 0;
}