#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

using ll = long long;
const ll N = 500010, mod = 998244353, SZ = (1 << 18) + 5;
static char buf[SZ], *bgn = buf, *til = buf;
char getc()
{
    if(bgn == til)  bgn = buf, til = buf + fread(buf, 1, SZ, stdin);
    return bgn == til ? EOF : *bgn++;
}
template<typename T>
void read(T &x)
{
    char ch = getc();  T fh = 0;   x = 0;
    while(ch < '0' || ch > '9')    fh |= (ch == '-'), ch = getc();
    while(ch >= '0' && ch <= '9')   x = x * 10 + ch - '0', ch = getc();
    x = fh ? -x : x;
}
template<typename Type, typename... argc>
void read(Type &x, argc &...args)   {read(x), read(args...);}
template<typename T>
void print(T x)
{
    if(x < 0)  putchar('-'), x = -x;
    if(x / 10)  print(x / 10);
    putchar(x % 10 + '0');
}
mt19937 rnd(std::chrono::steady_clock().now().time_since_epoch().count());
int n, q, s[N], op, li, ri;
char str[N];
ll tmp[3][6];
ll qmi(ll a, ll b)
{
    ll res = 1;
    for(; b; b >>= 1, a = a * a % mod)  if(b & 1)   res = res * a % mod;
    return res;
}
struct matrix
{
    ll a[3][3];
    matrix()    {memset(a, 0, sizeof(a));}
    ll * operator [](int x) {return a[x];}
}I, f[3], iv[3];
bool operator != (const matrix &x, const matrix &y)
{
    for(int i = 0; i < 3; ++i)
        for(int j = 0; j < 3; ++j)  if(x.a[i][j] != y.a[i][j])  return 1;
    return 0;
}
matrix operator * (const matrix &x, const matrix &y)
{
    matrix res;
    for(int i = 0; i < 3; ++i)
        for(int k = 0; k < 3; ++k)  if(x.a[i][k])
            for(int j = 0; j < 3; ++j)  res[i][j] = (res[i][j] + x.a[i][k] * y.a[k][j] % mod) % mod;
    return res;
}
void get(matrix &x)
{
    for(int i = 0; i < 3; ++i)
        for(int j = 0; j < 3; ++j)  x[i][j] = rnd() % mod;
}
matrix inv(matrix x)
{
    memset(tmp, 0, sizeof(tmp));
    for(int i = 0; i < 3; ++i)
    {
        tmp[i][i + 3] = 1;
        for(int j = 0; j < 3; ++j)  tmp[i][j] = x[i][j];
    }
    for(int i = 0; i < 3; ++i)
    {
        int nw = 3;
        for(int j = i; j < 3; ++j)  
            if(tmp[j][i] > 0) {nw = j;    break;}
        if(nw == 3) return I;
        for(int j = 0; j < 6; ++j)  swap(tmp[i][j], tmp[nw][j]);
        for(int j = 0; j < 3; ++j)
        {
            if(i == j)  continue;
            ll divv = tmp[j][i] * qmi(tmp[i][i], mod - 2) % mod;
            for(int k = 0; k < 6; ++k)  tmp[j][k] = (tmp[j][k] - divv * tmp[i][k] % mod + mod) % mod;
        }
    }
    for(int i = 0; i < 3; ++i)
        for(int j = 0; j < 3; ++j)  x[i][j] = tmp[i][j + 3] * qmi(tmp[i][i], mod - 2) % mod;
    return x;
}
struct segtree
{
    matrix nd[N << 2][3];   int tag[N << 2];
    int ls(int x)   {return x << 1;}
    int rs(int x)   {return x << 1 | 1;}
    void pushup(int x)  
    {
        for(int i = 0; i < 3; ++i)  nd[x][i] = nd[ls(x)][i] * nd[rs(x)][i];
    }
    void upd(int x, int val)    
    {
        matrix lsh[3];
        for(int i = 0; i < 3; ++i)  lsh[i] = nd[x][(i + val) % 3];
        for(int i = 0; i < 3; ++i)  nd[x][i] = lsh[i];
        tag[x] = (tag[x] + val) % 3;
    }
    void pushdown(int x)    {if(tag[x]) upd(ls(x), tag[x]), upd(rs(x), tag[x]), tag[x] = 0;}
    void build(int l, int r, int p) 
    {
        if(l == r)
        {
            for(int i = 0; i < 3; ++i)  nd[p][i] = (l & 1) ? f[(s[l] + i) % 3] : iv[(s[l] + i) % 3];
            return;
        }
        int mid = (l + r) >> 1;
        build(l, mid, ls(p)), build(mid + 1, r, rs(p));
        pushup(p);
    }
    void update(int l, int r, int val, int nl, int nr, int p)   
    {
        if(l <= nl && nr <= r)  return upd(p, val);
        pushdown(p);
        int mid = (nl + nr) >> 1;
        if(mid >= l)    update(l, r, val, nl, mid, ls(p));
        if(mid < r) update(l, r, val, mid + 1, nr, rs(p));
        pushup(p);
    }
    matrix query(int l, int r, int nl, int nr, int p)   
    {
        if(l <= nl && nr <= r)  return nd[p][0];
        pushdown(p);
        int mid = (nl + nr) >> 1;   matrix res = I;
        if(mid >= l)    res = res * query(l, r, nl, mid, ls(p));
        if(mid < r) res = res * query(l, r, mid + 1, nr, rs(p));
        return res;
    }
}tree;
int main()
{
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n >> q >> (str + 1);
    for(int i = 1; i <= n; ++i) s[i] = str[i] - '0';
    I[0][0] = I[1][1] = I[2][2] = 1;
    for(int i = 0; i < 3; ++i)
    {
        get(f[i]), iv[i] = inv(f[i]);
        while((f[i] * iv[i]) != I)  get(f[i]), iv[i] = inv(f[i]);
    }
    tree.build(1, n, 1);
    for(int i = 1; i <= q; ++i)
    {
        cin >> op >> li >> ri;
        if(op == 1) tree.update(li, ri, 1, 1, n, 1);
        else    
        {
            matrix tmp = tree.query(li, ri, 1, n, 1);
            puts(tmp != I ? "No" : "Yes");
        }
    }
    return 0;
}