/*
* @Author: ftt2333
* @Email: [email protected]
* @LastEditTime: 2023-07-10 16:51:09
*/

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

constexpr int maxn = 5e5 + 10, mod = 1011451423;
int n, q;
char a[maxn];
mt19937 rnd(random_device{}());
uniform_int_distribution<int> range(0, mod - 1);

struct mat {
  int a00, a01, a10, a11;
  mat() {}
  mat(int a, int b, int c, int d) : a00(a), a01(b), a10(c), a11(d) {}
  mat operator*(const mat &rhs) const {
    return mat(
      (1ll * a00 * rhs.a00 + 1ll * a01 * rhs.a10) % mod,
      (1ll * a00 * rhs.a01 + 1ll * a01 * rhs.a11) % mod,
      (1ll * a10 * rhs.a00 + 1ll * a11 * rhs.a10) % mod,
      (1ll * a10 * rhs.a01 + 1ll * a11 * rhs.a11) % mod
    );
  }
  bool operator!=(const mat &rhs) const {
    return (a00 != rhs.a00) || (a01 != rhs.a01) ||
           (a10 != rhs.a10) || (a11 != rhs.a11);
  }
} E1(1, 0, 0, 1);

mat qpow(mat a, int b) {
  mat res = E1;
  for (; b; b >>= 1, a = a * a)
    if (b & 1) res = res * a;
  return res;
}

mat gen() {
  mat res = mat(range(rnd), range(rnd), range(rnd), range(rnd));;
  while (qpow(res, mod - 1) != E1) {
    res = mat(range(rnd), range(rnd), range(rnd), range(rnd));
  }
  return res;
}

mat base[3], inv[3];
mat t[maxn << 2][3];
int lz[maxn << 2];

#define lc (x << 1)
#define rc (x << 1 | 1)
#define mid (l + r >> 1)

void cg(int x, int v) {
  if (!v) return;
  if (v == 1) {
    swap(t[x][0], t[x][2]);
    swap(t[x][0], t[x][1]);
  } else {
    swap(t[x][0], t[x][2]);
    swap(t[x][1], t[x][2]);
  }
  lz[x] = (lz[x] + v) % 3;
}
void down(int x) {
  cg(lc, lz[x]), cg(rc, lz[x]);
  lz[x] = 0;
}
void up(int x) {
  for (int i = 0; i < 3; ++i) {
    t[x][i] = t[lc][i] * t[rc][i];
  }
}

void upd(int x, int l, int r, int a, int b, int v) {
  if (a > r || l > b) return;
  if (a <= l && r <= b) return cg(x, v);
  down(x);
  upd(lc, l, mid, a, b, v);
  upd(rc, mid + 1, r, a, b, v);
  up(x);
}
mat query(int x, int l, int r, int a, int b) {
  if (a > r || l > b) return E1;
  if (a <= l && r <= b) return t[x][0];
  down(x);
  return query(lc, l, mid, a, b) * query(rc, mid + 1, r, a, b);
}

void build(int x, int l, int r) {
  if (l == r) {
    if (l & 1) {
      for (int i = 0; i < 3; ++i) {
        t[x][i] = base[(a[l] - '0' + i) % 3];
      }
    } else {
      for (int i = 0; i < 3; ++i) {
        t[x][i] = inv[(a[l] - '0' + i) % 3];
      }
    }
    return;
  }
  build(lc, l, mid), build(rc, mid + 1, r);
  up(x);
}

int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif
  cin >> n >> q;
  for (int i = 0; i < 3; ++i) {
    base[i] = gen(), inv[i] = qpow(base[i], mod - 2);
  }
  cin >> a + 1;
  build(1, 1, n);
  for (int i = 1; i <= q; ++i) {
    int op, l, r;
    cin >> op >> l >> r;
    if (op == 1) {
      upd(1, 1, n, l, r, 1);
    } else {
      cout << ((query(1, 1, n, l, r) != E1) ? "NO" : "YES") << '\n';
    }
  }
}