#include <bits/stdc++.h>
using namespace std;
const int N = 5e5+10,P = 1e9+7;
int n,q;
char s[N];
mt19937 rnd(time(0));
struct Matrix{
  int a[2][2];
  Matrix(){memset(a,0,sizeof a);}
  void identity(){
    a[0][0] = 1,a[0][1] = 0,a[1][0] = 0,a[1][1] = 1;
  }
  bool operator==(const Matrix &b){
    return a[0][0]==b.a[0][0]&&a[0][1]==b.a[0][1]&&a[1][0]==b.a[1][0]&&a[1][1]==b.a[1][1];
  }
  void rand(){
    a[0][0] = rnd()%P;
    a[0][1] = rnd()%P;
    a[1][0] = rnd()%P;
    a[1][1] = rnd()%P;
  }
  void print(){
    cout << "[" << a[0][0] << " " << a[0][1] << "]\n";
    cout << "[" << a[1][0] << " " << a[1][1] << "]\n\n";
  }
}A[3],B[3],I;
Matrix operator *(const Matrix &a, const Matrix &b){
    Matrix c;
    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] += 1ll * a.a[i][k] * b.a[k][j] % P)%=P;
    return c;
  }
inline Matrix qpow(Matrix a,int b){
  Matrix res = I;
  while(b){
    if(b&1) res = res*a;
    a = a*a;
    b>>=1;
  }
  return res;
}
inline bool invertible(Matrix c){
  return qpow(c,P-1) == I;
}
struct ST{
  int l,r;
  Matrix w[3];
  int tag;
}t[N<<2];
void pushup(int p){
  for(int i = 0; i < 3; ++ i)
    t[p].w[i] = t[p<<1].w[i] * t[p<<1|1].w[i];
}
void upd(int p,int c){
    rotate(t[p].w,t[p].w+c,t[p].w+3);
    t[p].tag = (t[p].tag + c) % 3;
}
void pushdown(int p){
  if(t[p].tag){
    upd(p<<1,t[p].tag),upd(p<<1|1,t[p].tag);
    t[p].tag = 0;
  }
}

void build(int p,int l,int r){
  t[p].l = l,t[p].r = r;
  if(l == r){
    int c = s[l]-'0';
    if(l&1){
      for(int i = 0; i < 3; ++ i)t[p].w[i] = A[(c+i)%3];
    }else{
      for(int i = 0; i < 3; ++ i)t[p].w[i] = B[(c+i)%3];
    }
    return;
  }
  int mid = l + r >> 1;
  build(p<<1,l,mid),build(p<<1|1,mid+1,r);
  pushup(p);
}
Matrix query(int p,int l,int r){
  if(t[p].l >= l && t[p].r <= r)return t[p].w[0];
  pushdown(p);
  int mid = t[p].l + t[p].r >> 1;
  Matrix res = I;
  if(l <= mid)res = res * query(p<<1,l,r);
  if(r > mid)res = res * query(p<<1|1,l,r);
  return res;
}
void update(int p,int l,int r){
  if(t[p].l >= l && t[p].r <= r){
    upd(p,1);
    return;
  }
  pushdown(p);
  int mid = t[p].l + t[p].r >> 1;
  if(l <= mid)update(p<<1,l,r);
  if(r > mid)update(p<<1|1,l,r);
  pushup(p);
}
int main(){
  ios::sync_with_stdio(false),cin.tie(0);
  I.identity();
  for(int i = 0; i < 3; ++ i){
    do {A[i].rand();}
    while(!invertible(A[i]));
    B[i] = qpow(A[i],P-2);
  }
  cin >> n >> q >> (s+1);
  build(1,1,n);
  while(q--){
    int op,l,r;
    cin >> op >> l >> r;
    if(op==1)update(1,l,r);
    else{
      cout << ((query(1,l,r) == I) ? "Yes" : "No") << "\n";
    }
  }
  return 0;
}