#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e5 + 5;
typedef long long ll;
const int mod = 998244353;
ll qpow(ll x, ll y) {
    ll res = 1;
    while(y) {
        if(y & 1) res = res * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return res;
}
struct Matrix {
    ll a[2][2];
    // inverse matrix
    Matrix operator~() {
        Matrix res;
        ll det = (a[0][0] * a[1][1] % mod - a[0][1] * a[1][0] % mod + mod) % mod;
        res.a[0][0] = a[1][1] * qpow(det, mod - 2) % mod;
        res.a[1][1] = a[0][0] * qpow(det, mod - 2) % mod;
        res.a[0][1] = (mod - a[0][1]) * qpow(det, mod - 2) % mod;
        res.a[1][0] = (mod - a[1][0]) * qpow(det, mod - 2) % mod;
        return res;
    }
    // multiply
    Matrix operator*(const Matrix &rhs) {
        Matrix res;
        for(int i=0;i<2;i++)
            for(int j=0;j<2;j++) {
                res.a[i][j] = 0;
                for(int k=0;k<2;k++)
                    res.a[i][j] += a[i][k] * rhs.a[k][j];
                res.a[i][j] %= mod;
            }
        return res;
    }
    // is identity matrix
    bool is_identity() {
        return a[0][0] == 1 && a[0][1] == 0 && a[1][0] == 0 && a[1][1] == 1;
    }
}mx[10];
string s;
struct SegmentTree {
    struct Node {
        int l, r, lazy;
        Matrix val[3];
    }t[N<<2];
    #define ls(x) ((x)<<1)
    #define rs(x) ((x)<<1|1)
    #define mid(x) ((t[x].l + t[x].r)>> 1)
    void push_up(int x) {
        for(int i=0;i<3;i++)
            t[x].val[i] = t[ls(x)].val[i] * t[rs(x)].val[i];
    }
    void push_down(int x){
        if(t[x].lazy) {
            t[ls(x)].lazy = (t[x].lazy + t[ls(x)].lazy) % 3;
            t[rs(x)].lazy = (t[x].lazy + t[rs(x)].lazy) % 3;
            rotate(t[ls(x)].val, t[ls(x)].val + t[x].lazy, t[ls(x)].val + 3);
            rotate(t[rs(x)].val, t[rs(x)].val + t[x].lazy, t[rs(x)].val + 3);
            t[x].lazy = 0;
        }
    }
    void build(int x, int l, int r) {
        t[x].l = l, t[x].r = r;
        if(l == r) {
            if(l % 2 == 0) {
                t[x].val[0] = mx[s[l-1] - '0'];
                t[x].val[1] = mx[(s[l-1] - '0' + 1) % 3];
                t[x].val[2] = mx[(s[l-1] - '0' + 2) % 3];
            }
            else {
                t[x].val[0] = mx[s[l-1] - '0' + 3]; 
                t[x].val[1] = mx[(s[l-1] - '0' + 1) % 3 + 3];
                t[x].val[2] = mx[(s[l-1] - '0' + 2) % 3 + 3];
            }
            return;
        }
        int mid = mid(x);
        build(ls(x), l, mid);
        build(rs(x), mid + 1, r);
        push_up(x);
    }
    void update(int x, int L, int R) {
        assert(L <= R);
        if(L <= t[x].l && t[x].r <= R) {
            t[x].lazy = (t[x].lazy + 1) % 3;
            rotate(t[x].val, t[x].val + 1, t[x].val + 3);
            return;
        }
        push_down(x);
        int mid = mid(x);
        if(L <= mid) update(ls(x), L, R);
        if(R > mid) update(rs(x), L, R);
        push_up(x);
    }
    Matrix query(int x, int L, int R) {
        assert(L <= R);
        if(L <= t[x].l && t[x].r <= R)
            return t[x].val[0];
        push_down(x);
        int mid = mid(x);
        if(R <= mid) return query(ls(x), L, R);
        else if(L > mid) return query(rs(x), L, R);
        else return query(ls(x), L, R) * query(rs(x), L, R);
    }
}sgt;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef _DEBUG
        freopen("data.txt", "r", stdin);
    #endif
    int n, m;
    cin>>n>>m>>s;
    for(int i=0;i<3;i++) {
        for(int j=0;j<2;j++)
            for(int k=0;k<2;k++)
                mx[i].a[j][k] = rand() % mod;
        mx[i+3] = ~mx[i];
    }
    sgt.build(1, 1, n);
    while(m--) {
        int opt;
        cin>>opt;
        if(opt == 2) {
            int l, r;
            cin>>l>>r;
            Matrix res = sgt.query(1, l, r);
            if(res.is_identity()) cout<<"Yes\n";
            else cout<<"No\n";
        }
        else {
            int l, r;
            cin>>l>>r;
            sgt.update(1, l, r);
        }
    }
}