#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ " = "), debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define gc getchar
#define pc putchar
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

template <class T = int> T read() {
  T x = 0; bool f = 0; char ch = gc();
  while (!isdigit(ch)) f = ch == '-', ch = gc();
  while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = gc();
  return f ? -x: x;
}
template <class T> void write(T x) {
  if (x >= 0) { if (x > 9) write(x / 10); pc(x % 10 + 48); }
  else { pc('-'); if (x < -9) write(-x / 10); pc(48 - x % 10); }
}

template <int P>
class mod_int {
  using Z = mod_int;

private:
  static int mo(int x) { return x < 0 ? x + P : x; }

public:
  int x;
  int val() const { return x; }
  mod_int() : x(0) {}
  template <class T>
  mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
  bool operator==(const Z &rhs) const { return x == rhs.x; }
  bool operator!=(const Z &rhs) const { return x != rhs.x; }
  Z operator-() const { return Z(x ? P - x : 0); }
  Z pow(long long k) const {
    Z res = 1, t = *this;
    while (k) {
      if (k & 1) res *= t;
      if (k >>= 1) t *= t;
    }
    return res;
  }
  Z &operator++() {
    x < P - 1 ? ++x : x = 0;
    return *this;
  }
  Z &operator--() {
    x ? --x : x = P - 1;
    return *this;
  }
  Z operator++(int) {
    Z ret = x;
    x < P - 1 ? ++x : x = 0;
    return ret;
  }
  Z operator--(int) {
    Z ret = x;
    x ? --x : x = P - 1;
    return ret;
  }
  Z inv() const { return pow(P - 2); }
  Z &operator+=(const Z &rhs) {
    (x += rhs.x) >= P && (x -= P);
    return *this;
  }
  Z &operator-=(const Z &rhs) {
    (x -= rhs.x) < 0 && (x += P);
    return *this;
  }
  Z &operator*=(const Z &rhs) {
    x = 1ULL * x * rhs.x % P;
    return *this;
  }
  Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                 \
  friend T operator o(const Z &lhs, const Z &rhs) {\
    Z res = lhs;                                   \
    return res o## = rhs;                          \
  }
  setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
};
const int P = 1011451423;
using Z = mod_int<P>;

const int N = 500010;

struct mat {
  Z a[3][3];
  friend mat operator*(mat x, mat y) {
    mat res;
    rep (i, 0, 2) rep (j, 0, 2) rep (k, 0, 2)
      res.a[i][j] += x.a[i][k] * y.a[k][j];
    return res;
  }
  friend bool operator==(mat x, mat y) {
    rep (i, 0, 2) rep (j, 0, 2)
      if (x.a[i][j].x != y.a[i][j].x) return 0;
    return 1;
  }
} I, e[3], ie[3], tmp[3], t[N << 2][3];

int n, q, a[N], lz[N << 2];
char s[N];

#define mid ((l + r) >> 1)

void build(int c, int l, int r) {
  if (l == r) {
    rep (i, 0, 2) t[c][i] = (l & 1 ? e[(a[l] + i) % 3] : ie[(a[l] + i) % 3]);
    return;
  }
  build(c << 1, l, mid), build(c << 1 | 1, mid + 1, r);
  rep (i, 0, 2) t[c][i] = t[c << 1][i] * t[c << 1 | 1][i];
}

void upd(int, int, int, int, int, int);

void down(int c, int l, int r) {
  if (!lz[c]) return;
  upd(c << 1, l, mid, l, mid, lz[c]);
  upd(c << 1 | 1, mid + 1, r, mid + 1, r, lz[c]);
  lz[c] = 0;
}

void upd(int c, int l, int r, int x, int y, int val) {
  if (l == x && r == y) {
    rep (i, 0, 2) tmp[i] = t[c][(i + val) % 3];
    rep (i, 0, 2) t[c][i] = tmp[i];
    return lz[c] += val, void();
  }
  down(c, l, r);
  if (y <= mid) upd(c << 1, l, mid, x, y, val);
  else if (x > mid) upd(c << 1 | 1, mid + 1, r, x, y, val);
  else upd(c << 1, l, mid, x, mid, val), upd(c << 1 | 1, mid + 1, r, mid + 1, y, val);
  rep (i, 0, 2) t[c][i] = t[c << 1][i] * t[c << 1 | 1][i];
}

mat qry(int c, int l, int r, int x, int y) {
  if (l == x && r == y) return t[c][0];
  down(c, l, r);
  if (y <= mid) return qry(c << 1, l, mid, x, y);
  else if (x > mid) return qry(c << 1 | 1, mid + 1, r, x, y);
  else return qry(c << 1, l, mid, x, mid) * qry(c << 1 | 1, mid + 1, r, mid + 1, y);
}

#undef mid

int main() {
  I.a[0][0] = I.a[1][1] = I.a[2][2] = 1;
   e[0].a[0][0] = 149311330 ,  e[0].a[0][1] = 745920638 ,  e[0].a[0][2] = 590182113 ;
   e[0].a[1][0] = 49455219  ,  e[0].a[1][1] = 390176771 ,  e[0].a[1][2] = 603107326 ;
   e[0].a[2][0] = 320530265 ,  e[0].a[2][1] = 738917136 ,  e[0].a[2][2] = 10584953  ;
  ie[0].a[0][0] = 864956700 , ie[0].a[0][1] = 16966590  , ie[0].a[0][2] = 113957230 ;
  ie[0].a[1][0] = 156311632 , ie[0].a[1][1] = 464839647 , ie[0].a[1][2] = 395820457 ;
  ie[0].a[2][0] = 443670509 , ie[0].a[2][1] = 398095536 , ie[0].a[2][2] = 646743463 ;
   e[1].a[0][0] = 769983566 ,  e[1].a[0][1] = 362048581 ,  e[1].a[0][2] = 213658531 ;
   e[1].a[1][0] = 167016353 ,  e[1].a[1][1] = 217426165 ,  e[1].a[1][2] = 177471655 ;
   e[1].a[2][0] = 758729966 ,  e[1].a[2][1] = 92163388  ,  e[1].a[2][2] = 424313941 ;
  ie[1].a[0][0] = 65945684  , ie[1].a[0][1] = 188557717 , ie[1].a[0][2] = 1000040845;
  ie[1].a[1][0] = 943575393 , ie[1].a[1][1] = 776085765 , ie[1].a[1][2] = 577644002 ;
  ie[1].a[2][0] = 225018785 , ie[1].a[2][1] = 1000326075, ie[1].a[2][2] = 966948948 ;
   e[2].a[0][0] = 603302693 ,  e[2].a[0][1] = 125686205 ,  e[2].a[0][2] = 1011027776;
   e[2].a[1][0] = 353870952 ,  e[2].a[1][1] = 334514    ,  e[2].a[1][2] = 821570331 ;
   e[2].a[2][0] = 63074462  ,  e[2].a[2][1] = 222769720 ,  e[2].a[2][2] = 70905004  ;
  ie[2].a[0][0] = 817345206 , ie[2].a[0][1] = 13515995  , ie[2].a[0][2] = 821910570 ;
  ie[2].a[1][0] = 62110458  , ie[2].a[1][1] = 34947523  , ie[2].a[1][2] = 137477174 ;
  ie[2].a[2][0] = 445401493 , ie[2].a[2][1] = 336008420 , ie[2].a[2][2] = 100513012 ;
  n = read(), q = read(), scanf("%s", s + 1);
  rep (i, 1, n) a[i] = s[i] - '0';
  build(1, 1, n);
  while (q--) {
    int op = read(), l = read(), r = read();
    if (op == 1) upd(1, 1, n, l, r, 1);
    else puts(qry(1, 1, n, l, r) == I ? "Yes" : "No");
  }
}