#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i < (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
using namespace std;
namespace qiqi {
	const int P = 1e9+7,M = 3,sz = 2;
	int pow(int b,int k) {
		int a = 1; while (k) {
			if (k&1) a = 1ll*a*b%P;
			b = 1ll*b*b%P; k >>= 1;
		}
		return a;
	}
	struct Mat {
		int a[sz][sz];
		Mat() {memset(a,0,sizeof(a));}
		Mat(int k) {
			memset(a,0,sizeof(a));
			rep(i,0,sz) a[i][i] = k;
		}
		Mat friend operator * (Mat x,Mat y) {
			Mat z; rep(i,0,sz) rep(j,0,sz) rep(k,0,sz) {
				z.a[i][k] = (z.a[i][k]+1ll*x.a[i][j]*y.a[j][k]%P)%P;
			}
			return z;
		}
		bool friend operator == (Mat x,Mat y) {
			rep(i,0,sz) rep(j,0,sz) {
				if (x.a[i][j] != y.a[i][j]) return 0;
			}
			return 1;
		}
		Mat inv() {
			Mat a = *this,b(1);
			rep(i,0,sz) {
				if (!a.a[i][i]) {
					rep(j,i+1,sz) if (a.a[j][i]) {
						swap(a.a[i],a.a[j]);
						swap(b.a[i],b.a[j]);
						break;
					}
				}
				int x = pow(a.a[i][i],P-2);
				rep(j,0,sz) {
					a.a[i][j] = 1ll*x*a.a[i][j]%P;
					b.a[i][j] = 1ll*x*b.a[i][j]%P;
				}
				rep(j,0,sz) if (i != j) {
					int x = (P-a.a[j][i])%P;
					rep(k,0,sz) {
						a.a[j][k] = (a.a[j][k]+1ll*x*a.a[i][k]%P)%P;
						b.a[j][k] = (b.a[j][k]+1ll*x*b.a[i][k]%P)%P;
					}
				}
			}
			return b;
		}
	};
	struct Seg {
#define ls (x<<1)
#define rs (ls|1)
		int n; vector<array<Mat,M>> a; vi tag;
		void push_up(int x) {
			rep(i,0,M) a[x][i] = a[ls][i]*a[rs][i];
		}
		Seg(vector<array<Mat,M>> &vec) {
			n = sz(vec); a.assign(n*4,{0,0,0}); tag.assign(n*4,0);
			function<void(int,int,int)> build = [&](int x,int l,int r) {
				if (r-l == 1) {a[x] = vec[l]; return;} int mid = l+((r-l)>>1);
				build(ls,l,mid); build(rs,mid,r); push_up(x);
			};
			build(1,0,n);
		}
		void apl(int x,int k) {
			array<Mat,M> p = a[x];
			rep(i,0,M) a[x][i] = p[(i+k)%M];
			tag[x] = (tag[x]+k)%M;
		}
		void push_down(int x) {
			if (!tag[x]) return;
			apl(ls,tag[x]); apl(rs,tag[x]); tag[x] = 0;
		}
		void upd(int x,int l,int r,int pl,int pr) {
			if (pl <= l && r <= pr) return apl(x,1);
			int mid = l+((r-l)>>1); push_down(x);
			if (pl < mid) upd(ls,l,mid,pl,pr);
			if (pr > mid) upd(rs,mid,r,pl,pr);
			push_up(x);
		}
		void upd(int pl,int pr) {
			upd(1,0,n,pl,pr);
		}
		Mat qry(int x,int l,int r,int pl,int pr) {
			if (pl <= l && r <= pr) return a[x][0];
			int mid = l+((r-l)>>1); push_down(x); Mat k(1);
			if (pl < mid) k = k*qry(ls,l,mid,pl,pr);
			if (pr > mid) k = k*qry(rs,mid,r,pl,pr);
			return k;
		}
		Mat qry(int pl,int pr) {
			return qry(1,0,n,pl,pr);
		}
	};
	void main() {
		int n,Q; cin >> n >> Q;
		mt19937 gen(random_device{}());
		uniform_int_distribution<int> rnd(0,P-1);
		array<Mat,M> p[2];
		rep(i,0,M) {
			int a,b,c,d;
			do {
				a = rnd(gen);
				b = rnd(gen);
				c = rnd(gen);
				d = rnd(gen);
			} while (1ll*a*d%P == 1ll*b*c%P);
			p[0][i].a[0][0] = a;
			p[0][i].a[0][1] = b;
			p[0][i].a[1][0] = c;
			p[0][i].a[1][1] = d;
			p[1][i] = p[0][i].inv();
		}
		string s; cin >> s;
		vector<array<Mat,M>> vec(n);
		rep(i,0,n) {
			int x = s[i]-'0';
			rep(j,0,M) {
				vec[i][j] = p[i&1][(j+x)%M];
			}
		}
		Seg seg(vec);
		while (Q--) {
			int o,l,r; cin >> o >> l >> r; --l;
			if (o == 1) {
				seg.upd(l,r);
			}
			else {
				cout << (seg.qry(l,r) == Mat(1) ? "Yes\n" : "No\n");
			}
		}
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	qiqi::main();
	return 0;
}