# include <bits/stdc++.h>
# define int long long
using namespace std;
const int N = 5e5 + 5;
const int M = 3;
const int MOD = 998244353;
int n, q;
struct Matrix
{
	int a[M][M];
	bool check()
	{
		if(a[0][0] == 1 && a[1][1] == 1 && a[0][1] == 0 && a[1][0] == 0) return 1;
		return 0;
	}
	void print()
	{
		cout<<a[0][0]<<" "<<a[0][1]<<endl<<a[1][0]<<" "<<a[1][1]<<endl<<endl; 
	}
};

Matrix danwei;

Matrix operator * (Matrix a, Matrix b)
{
	Matrix c;
	memset(c.a, 0, sizeof(c.a));
	for(int i = 0; i < 2; i++)
	{
		for(int j = 0; j < 2; j++)
		{
			for(int k = 0; k < 2; k++)
			{
				c.a[i][j] = c.a[i][j] + a.a[i][k] * b.a[k][j] % MOD;
				c.a[i][j] %= MOD;
			}
		}
	}
	return c;
}

Matrix x[3];
Matrix x_ni[3];

int a[N];

# define lson (2 * i)
# define rson (2 * i + 1)

struct SegmentTr
{
	Matrix sum[4 * N][3];
	int lazy[4 * N];
	
	void update(int i, int add)
	{
		Matrix sum2[3];
		for(int j = 0; j < 3; j++)
		{
			sum2[j] = sum[i][j]; 
		}
		for(int j = 0; j < 3; j++)
		{
			sum[i][j] = sum2[(j + add) % 3];
		}
		lazy[i] += add;
		lazy[i] %= 3;
	}
	
	void down(int i)
	{
		update(lson, lazy[i]);
		update(rson, lazy[i]);
		lazy[i] = 0;
	}
	
	void pushup(int i)
	{
		for(int j = 0; j < 3; j++)
		{
			sum[i][j] = sum[lson][j] * sum[rson][j];
		}
	}
	
	void build(int i, int l, int r)
	{
		lazy[i] = 0;
		if(l == r)
		{
			if(l & 1)
			{
				for(int j = 0; j < 3; j++)
				{
					sum[i][j] = x[(a[l] + j) % 3];
				}
			}
			else
			{
				for(int j = 0; j < 3; j++)
				{
					sum[i][j] = x_ni[(a[l] + j) % 3];
				}
			}
			return;
		}
		int mid = l + r >> 1;
		build(lson, l, mid);
		build(rson, mid + 1, r);
		pushup(i);
	}
	
	void modify(int i, int l, int r, int L, int R, int add)
	{
		if(r < L || l > R) 
		{
			return;
		}
		if(L <= l && r <= R)
		{
			update(i, add);
			return;
		}
		int mid = l + r >> 1;
		down(i);
		modify(lson, l, mid, L, R, add);
		modify(rson, mid + 1, r, L, R, add);
		pushup(i);
	}
	
	Matrix query(int i, int l, int r, int L, int R)
	{
		if(r < L || l > R) 
		{
			return danwei;
		}
		if(L <= l && r <= R)
		{
			return sum[i][0];
		}
		Matrix res = danwei;
		int mid = l + r >> 1;
		down(i);
		res = query(lson, l, mid, L, R) * res;
		res = res * query(rson, mid + 1, r, L, R);
		pushup(i);
		return res;
	}
}Tr;

void init()
{
	x[0] = (Matrix) {{{2, 3}, {5, 7}}};
	x[1] = (Matrix) {{{11, 13}, {17, 19}}};
	x[2] = (Matrix) {{{23, 29}, {31, 37}}};
	
	x_ni[0] = (Matrix) {{{998244346, 3}, {5, 998244351}}};
	x_ni[1] = (Matrix) {{{915057322, 582309207}, {915057325, 582309205}}};
	x_ni[2] = (Matrix) {{{103983786, 727886508}, {20796758, 145577301}}};
}

signed main()
{
	danwei = (Matrix) {{{ 1, 0}, {0, 1}}}; 
	init();
	cin >> n >> q;
	for(int i = 1; i <= n; i++)
	{
		char c;
		cin >> c;
		a[i] = c - '0';
	}
	Tr.build(1, 1, n);
//	for(int i=1;i<=n;i++) Tr.query(1,1,n,i,i).print();
	while(q--)
	{
		int opt, l, r;
		cin >> opt >> l >> r;
		if(opt == 1)
		{
			Tr.modify(1, 1, n, l, r, 1);
		}
		else
		{
//			Tr.query(1, 1, n, l, r).print();
			if(Tr.query(1, 1, n, l, r).check())
			{
				cout << "Yes\n";
			}
			else
			{
				cout << "No\n"; 
			}
		}
	}
	return 0;
}