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

const int N = 5e5 + 5, Mod = 998244353;
typedef long long LL;

int qpow(int a, int k){
    int ans = 1;
    while(k){
        if(k & 1)ans = 1ll * ans * a % Mod;
        k >>= 1;
        a = 1ll * a * a % Mod;
    }

    return ans;
}

mt19937 rnd(23472347);

struct Matrix{
    int a[2][2];

    void init(){
        memset(a, 0, sizeof(a));
    }

    inline Matrix operator* (const Matrix &w){
        static Matrix c;
        c.init();

        c.a[0][0] = (1ll * a[0][0] * w.a[0][0] + 1ll * a[0][1] * w.a[1][0]) % Mod;
        c.a[1][0] = (1ll * a[1][0] * w.a[0][0] + 1ll * a[1][1] * w.a[1][0]) % Mod;
        c.a[0][1] = (1ll * a[0][0] * w.a[0][1] + 1ll * a[0][1] * w.a[1][1]) % Mod;
        c.a[1][1] = (1ll * a[1][0] * w.a[0][1] + 1ll * a[1][1] * w.a[1][1]) % Mod;
        

        // c.a[0][0] = (1ll * a[i])
        // c.a[0][0] = (1ll * );

        // 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] = (c.a[i][j] + 1ll * a[i][k] * w.a[k][j]) % Mod;
        //         }
        //     }
        // }

        return c;
    }

    inline bool operator== (const Matrix &w){
        return a[0][0] == w.a[0][0] && a[0][1] == w.a[0][1] && a[1][0] == w.a[1][0] && a[1][1] == w.a[1][1];
    }
}M[3][2], I;

struct Node{
    int l, r;
    Matrix m[3];
    int add;
}tr[N * 4];

#define lc (x << 1)
#define rc (x << 1 | 1)

inline void update(int x){
    tr[x].m[0] = tr[lc].m[0] * tr[rc].m[0];
    tr[x].m[1] = tr[lc].m[1] * tr[rc].m[1];
    tr[x].m[2] = tr[lc].m[2] * tr[rc].m[2];
}

Matrix tmp[3];

inline void change(int x, int v){
    tmp[0] = tr[x].m[0];
    tmp[1] = tr[x].m[1];
    tmp[2] = tr[x].m[2];
    tr[x].m[0] = tmp[v % 3];
    tr[x].m[1] = tmp[(v + 1) % 3];
    tr[x].m[2] = tmp[(v + 2) % 3];
    tr[x].add = (tr[x].add + v) % 3;
}

inline void down(int x){
    if(tr[x].add){
        change(lc, tr[x].add);
        change(rc, tr[x].add);
        tr[x].add = 0;
    }
}

Matrix w[N][3];

void build(int x, int l, int r){
    tr[x].l = l, tr[x].r = r;
    if(tr[x].l == tr[x].r){
        tr[x].m[0] = w[l][0];
        tr[x].m[1] = w[l][1];
        tr[x].m[2] = w[l][2];
        return ;
    }

    int mid = (l + r) >> 1;
    build(lc, l, mid), build(rc, mid + 1, r);
    update(x);
}

void modify(int x, int l, int r){
    if(l <= tr[x].l && tr[x].r <= r){
        return change(x, 1);
    }
    down(x);

    int mid = (tr[x].l + tr[x].r) >> 1;
    if(l <= mid)modify(lc, l, r);
    if(r > mid) modify(rc, l, r);
    update(x);
}

Matrix query(int x, int l, int r){
    if(l <= tr[x].l && tr[x].r <= r){
        return tr[x].m[0];
    }
    down(x);

    int mid = (tr[x].l + tr[x].r) >> 1;
    Matrix ans = I;
    if(l <= mid)ans = ans * query(lc, l, r);
    if(r > mid) ans = ans * query(rc, l, r);

    return ans;
}

char S[N];

int main(){
    // freopen("in", "r", stdin);
    // freopen("input2.in", "r", stdin);
    
    // freopen("out", "w", stdout);

    for(int s = 0; s < 3; s ++){
        while(1){
            for(int i = 0; i <= 1; i ++) for(int j = 0; j <= 1; j ++){
                M[s][0].a[i][j] = (rnd() % Mod + Mod) % Mod;
            }

            int d = (1ll * M[s][0].a[0][0] * M[s][0].a[1][1] + Mod - 1ll * M[s][0].a[1][0] * M[s][0].a[0][1] % Mod) % Mod;

            if(d != 0){
                int invd = qpow(d, Mod - 2);
                M[s][1].a[0][0] = (1ll * M[s][0].a[1][1] * invd % Mod + Mod) % Mod;
                M[s][1].a[1][1] = (1ll * M[s][0].a[0][0] * invd % Mod + Mod) % Mod;
                M[s][1].a[0][1] = (- 1ll * M[s][0].a[0][1] * invd % Mod + Mod) % Mod;
                M[s][1].a[1][0] = (- 1ll * M[s][0].a[1][0] * invd % Mod + Mod) % Mod;
                break;
            }
        }
    }

    // M[0].a[0][1] = 
    // M[0].a[1][0] = qpow(M[0].a[0][1], Mod - 2);
    // M[1].a[0][1] = (rnd() % Mod + Mod) % Mod;
    // M[1].a[1][0] = qpow(M[0].a[0][1], Mod - 2);
    // M[2].a[0][1] = (rnd() % Mod + Mod) % Mod;
    // M[2].a[1][0] = qpow(M[0].a[0][1], Mod - 2);

    I.a[0][0] = I.a[1][1] = 1;

    int n, q;
    scanf("%d%d", &n, &q);

    scanf("%s", S + 1);

    for(int i = 1; i <= n; i ++){
        int t = S[i] - '0';
        for(int j = 0; j < 3; j ++){
            w[i][j] = M[(t + j) % 3][i & 1];
        }
    }

    build(1, 1, n);

    for(int i = 1; i <= q; i ++){
        int op, l, r;
        scanf("%d%d%d", &op, &l, &r);
        if(op == 1)modify(1, l, r);
        else puts(query(1, l, r) == I ? "Yes" : "No");
    }
}