#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#include <random>

using namespace std;

#define int long long
#define PII pair<int, int>
#define x first
#define y second
#define For(i, l, r) for(int i = l; i <= r; i ++)
#define Rep(i, l, r) for(int i = l; i >= r; i --)

bool TOU;

void in(int &x)
{
	char c = getchar(); int op = 1;
	while(c > '9' || c < '0') op *= (c == '-' ? -1 : 1), c = getchar();
	for(x = 0; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0'; x *= op;
}

const int N = 5e5 + 50, P = 1e9 + 9;

int n, m;
struct mat
{
	int a[2][2];
	void clear() {memset(a, 0, sizeof a);}
	void out()
	{
		For(i, 0, 1) For(j, 0, 1) printf("%lld%c",a[i][j], " \n"[j]); puts("----");
	}
	bool check()
	{
		if(a[0][1] || a[1][0]) return 0;
		if(a[0][0] != 1 || a[1][1] != 1) return 0;
		return 1;
	}
}t[N << 2][3], w[5], E;
int tag[N << 2];
char s[N];
mt19937 seed(19881220);
uniform_int_distribution<int> d1;

int ksm(int x, int y)
{
	int s = 1;while(y) {if(y & 1) s = s * x % P; x = x * x % P; y >>= 1;} return s;
}

mat operator * (mat a, mat b)
{
	mat c; c.clear();
	For(i, 0, 1) For(j, 0, 1) For(k, 0, 1)
		c.a[i][j] = (c.a[i][j] + a.a[i][k] * b.a[k][j]) % P;
	return c;
}

#define ls (u << 1)
#define rs (u << 1 | 1)

void up(int u)
{
	For(i, 0, 2) t[u][i] = t[ls][i] * t[rs][i];
}

void build(int u, int l, int r)
{
	if(l == r)
	{
		For(i, 0, 2) t[u][i] = w[(s[l] - '0' + i) % 3];
		return ;
	}
	int mid = (l + r) >> 1;
	build(ls, l, mid); build(rs, mid + 1, r); up(u);
}

void push_tag(int u, int x)
{
	tag[u] = (tag[u] + x) % 3;
	while(x --)
	{
		swap(t[u][0], t[u][1]); swap(t[u][1], t[u][2]);
	}
}

void down(int u)
{
	if(!tag[u]) return ; push_tag(ls, tag[u]); push_tag(rs, tag[u]); tag[u] = 0;
}

void modify(int u, int l, int r, int x, int y)
{
	if(x <= l && r <= y) {push_tag(u, 1); return ;}
	int mid = (l + r) >> 1; down(u);
	if(x <= mid) modify(ls, l, mid, x, y);
	if(y > mid) modify(rs, mid + 1, r, x, y);
	up(u);
}

mat query(int u, int l, int r, int x, int y)
{
	if(x <= l && r <= y) return t[u][0];
	int mid = (l + r) >> 1; down(u);
	if(y <= mid) return query(ls, l, mid, x, y);
	if(x > mid) return query(rs, mid + 1, r, x, y);
	return query(ls, l, mid, x, y) * query(rs, mid + 1, r, x, y);
}

bool WEI;
signed main()
{
	in(n); in(m);
	For(i, 0, 2)
	{
		int a = d1(seed) % P, b = d1(seed) % P;
		int x = (1 + P - a * a % P) * ksm(b, P - 2) % P;
		int y = (P - a) % P;
		w[i].a[0][0] = a, w[i].a[0][1] = b;
		w[i].a[1][0] = x, w[i].a[1][1] = y;
	}
	E.clear(); E.a[0][0] = E.a[1][1] = 1;
	scanf("%s", s + 1);
	build(1, 1, n);
	For(i, 1, m)
	{
		int op, l, r; in(op); in(l); in(r);
		if(op == 1) modify(1, 1, n, l, r);
		else printf("%s\n", query(1, 1, n, l, r).check() ? "Yes" : "No");
	}
	return 0;
}