#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for(int i=(a); i<(n); ++i)
#define per(i, a, n) for(int i=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se second
#define lson o<<1
#define rson o<<1|1
#define gmid l[o]+r[o]>>1

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;

constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr int N = 5e5 + 10;

struct Matrix{
  ll x[2][2];
  Matrix operator * (Matrix A){
    Matrix C;
    rep(i, 0, 2){
      rep(j, 0, 2){
        ll &t = C.x[i][j];
        t = 0;
        rep(k, 0, 2)  t+= x[i][k] * A.x[k][j] % mod;
        t = t % mod;
      }
    }
    return C;
  }
  void init(ll a, ll b, ll c, ll d){
    x[0][0] = a; x[0][1] = b;
    x[1][0] = c; x[1][1] = d;
  }
  bool ok(){
    return x[0][0] == 1 && x[1][1] == 1 && x[0][1] == 0 && x[1][0] == 0;
  }
  void print(){
    rep(i, 0, 2){
      rep(j, 0, 2)  cout << x[i][j] <<  " ";
      cout << "\n";
    }
  }
};

Matrix A[3][2];

ll pow_mod(ll x, int p){
  ll s = 1;
  while(p){
    if(p & 1) s = s * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return s;
}

void init(){
  A[0][0].init(8149, 13773, 3866, 5766);
  A[0][1].init(377361348, 249554390, 721338926, 171832018);
  A[1][0].init(65, 5, 35, 54);
  A[1][1].init(521421788, 543272414, 808173839, 923413442);
  A[2][0].init(553, 300, 748, 71);
  A[2][1].init(658725778, 886254123, 652465756, 772107124);
}

int n, Q;
char s[N];
Matrix S[N<<2][3];
int l[N<<2], r[N<<2], lazy[N<<2];

void maintain(int o){
  rep(i, 0, 3)  S[o][i] = S[lson][i] * S[rson][i];
}

void build(int o, int L, int R){
  l[o] = L; r[o] = R;
  lazy[o] = 0;
  if(L < R){
    int mid = gmid;
    build(lson, L, mid);
    build(rson, mid+1, R);
    maintain(o);
  } else {
    int f = s[L] - '0';
    rep(i, 0, 3){
      S[o][i] = A[(f + i) % 3][L & 1];
    }
  }
}

void update(int o, int L, int R, int c);

int pushdown(int o){
  int mid = gmid;
  if(lazy[o]){
    update(lson, l[o], mid, lazy[o]);
    update(rson, mid+1, r[o], lazy[o]);
    lazy[o] = 0;
  }
  return mid;
}

void update(int o, int L, int R, int c){
  if(l[o] == L && r[o] == R){
    if(c == 1){
      swap(S[o][0], S[o][1]);
      swap(S[o][1], S[o][2]);
    } else {
      swap(S[o][0], S[o][2]);
      swap(S[o][1], S[o][2]);
    }

    lazy[o] = (lazy[o] + c) % 3;
    return;
  }
  int mid = pushdown(o);
  if(R <= mid)  update(lson, L, R, c);
  else if(L > mid)  update(rson, L, R, c);
  else{
    update(lson, L, mid, c);
    update(rson, mid+1, R, c);
  }
  maintain(o);
}

Matrix query(int o, int L, int R){
  if(l[o] == L && r[o] == R){
    return S[o][0];
  }
  int mid = pushdown(o);
  if(R <= mid)  return query(lson, L, R);
  if(L > mid) return query(rson, L, R);
  return query(lson, L, mid) * query(rson, mid+1, R);
}

void _main(){
  int op, l, r;
  init();
  cin >> n >> Q;
  cin >> (s + 1);
  build(1, 1, n);
  Matrix S;
  while(Q--){
    cin >> op >> l >> r;
    if(op == 1){
      update(1, l, r, 1);
    } else {
      S = query(1, l, r);
      if(S.ok()){
        cout << "Yes\n";
      } else {
        cout << "No\n";
      }
    }
  }
}

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  _main();
  return 0;
}