#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 5, P = 1e9 + 7;

struct MOD {
    int operator ()(long long x) {
        return x - (((__int128)x * 18446743944) >> 64) * P;
    }
} mod;

int ksm(int x, int y = P - 2) {
    int res = 1;
    while (y) {
        if (y & 1) res = 1ll * res * x % P;
        x = 1ll * x * x % P;
        y >>= 1;
    }
    return res;
}

int tr(long long x) {
    return (x % P + P) % P;
}

struct mat {
    int a[2][2];
    
    mat() {
        memset(a, 0, sizeof(a));
    }
    
    mat operator * (mat y) {
        mat res;
        res.a[0][0] = mod(1ll * a[0][0] * y.a[0][0] + 1ll * a[0][1] * y.a[1][0]);
        res.a[0][1] = mod(1ll * a[0][0] * y.a[0][1] + 1ll * a[0][1] * y.a[1][1]);
        res.a[1][0] = mod(1ll * a[1][0] * y.a[0][0] + 1ll * a[1][1] * y.a[1][0]);
        res.a[1][1] = mod(1ll * a[1][0] * y.a[0][1] + 1ll * a[1][1] * y.a[1][1]);
        return res;
    }
    
    int det() {
        return tr(1ll * a[0][0] * a[1][1] - 1ll * a[0][1] * a[1][0]);
    }
    
    int isIdent() {
        return tr(a[0][0]) == 1 && tr(a[0][1]) == 0 && tr(a[1][0]) == 0 && tr(a[1][1]) == 1;
    }
} id[3], rev[3];

struct info {
    mat o[3];
    int lazy;
} seg[1 << 21];

void pushup(int k) {
    for (int i = 0; i < 3; ++i) seg[k].o[i] = seg[k << 1].o[i] * seg[k << 1 | 1].o[i];
}

string S;

void build(int k, int l, int r) {
    if (l == r) {
        for (int i = 0; i < 3; ++i) {
            seg[k].o[i] = ((l & 1) ? id : rev)[(S[l] - '0' + i) % 3];
        }
        return;
    }
    int mid = (l + r) >> 1;
    build(k << 1, l, mid);
    build(k << 1 | 1, mid + 1, r);
    pushup(k);
}

void addTag(int k, int x) {
    x %= 3;
    if (!x) return;
    rotate(seg[k].o, seg[k].o + x, seg[k].o + 3);
    seg[k].lazy += x;
}

void pushdown(int k) {
    addTag(k << 1, seg[k].lazy);
    addTag(k << 1 | 1, seg[k].lazy);
    seg[k].lazy = 0;
}

void modify(int k, int l, int r, int x, int y) {
    if (l > y || r < x) return;
    if (l >= x && r <= y) {
        addTag(k, 1);
        return;
    }
    pushdown(k);
    int mid = (l + r) >> 1;
    modify(k << 1, l, mid, x, y);
    modify(k << 1 | 1, mid + 1, r, x, y);
    pushup(k);
}

mat query(int k, int l, int r, int x, int y) {
    if (l >= x && r <= y) return seg[k].o[0];
    pushdown(k);
    int mid = (l + r) >> 1;
    if (y <= mid) return query(k << 1, l, mid, x, y);
    if (x > mid) return query(k << 1 | 1, mid + 1, r, x, y);
    return query(k << 1, l, mid, x, y) * query(k << 1 | 1, mid + 1, r, x, y);
}

signed main() {
    int n, q; scanf("%d%d", &n, &q);
    cin >> S; S = ' ' + S;
    mt19937 rnd;
    for (int i = 0; i < 3; ++i) {
        id[i].a[0][0] = rnd() % P, id[i].a[0][1] = rnd() % P;
        id[i].a[1][0] = rnd() % P, id[i].a[1][1] = rnd() % P;
        rev[i].a[0][0] = id[i].a[1][1], rev[i].a[0][1] = P - id[i].a[0][1];
        rev[i].a[1][0] = P - id[i].a[1][0], rev[i].a[1][1] = id[i].a[0][0];
        int I = ksm(id[i].det());
        rev[i].a[0][0] = 1ll * rev[i].a[0][0] * I % P, rev[i].a[0][1] = 1ll * rev[i].a[0][1] * I % P;
        rev[i].a[1][0] = 1ll * rev[i].a[1][0] * I % P, rev[i].a[1][1] = 1ll * rev[i].a[1][1] * I % P;
    }
    build(1, 1, n);
    while (q--) {
        int opt, l, r; scanf("%d%d%d", &opt, &l, &r);
        if (opt == 1) {
            modify(1, 1, n, l, r);
        } else {
            if (query(1, 1, n, l, r).isIdent()) puts("Yes");
            else puts("No");
        }
    }
    return 0;
}