#include<iostream>
#include<cstdio>
#include<algorithm>
#include<random>
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define ls (u<<1)
#define rs (u<<1|1)
#define mid ((l+r)>>1)
using namespace std;
mt19937 rnd(131);
typedef long long ll;
const ll mod = 998244353;
const int N = 500010;
ll qpow(ll x, ll y = mod - 2){
    ll ret = 1;
    for(; y; y >>= 1, (x *= x) %= mod) if(y & 1) (ret *= x) %= mod;
    return ret;
}
namespace MATRIX{
    struct matrix{
        ll a[2][2];
        matrix() {a[0][0] = a[1][1] = a[0][1] = a[1][0] = 0;}
        matrix(ll x, ll y, ll z, ll w){
            a[0][0] = x, a[0][1] = y;
            a[1][0] = z, a[1][1] = w;
        }
        ll* operator [] (const int &x) {return a[x];}
        bool eq() {return a[0][0]==1&&a[1][1]==1&&!a[0][1]&&!a[1][0];}
    };
    matrix operator * (matrix x, matrix y){
        matrix ret;
        rep(i, 0, 1) rep(k, 0, 1) rep(j, 0, 1)
            (ret[i][j] += x[i][k] * y[k][j]) %= mod;
        return ret;
    }
    matrix inv(matrix x){
        ll a = x[0][0], b = x[0][1], c = x[1][0], d = x[1][1];
        ll tmp = qpow(((a*d - b*c)%mod+mod)%mod);
        return matrix{d*tmp%mod, (mod-b)*tmp%mod, (mod-c)*tmp%mod, a*tmp%mod};
    }
    matrix gen() {return matrix{rnd()%mod, rnd()%mod, rnd()%mod, rnd()%mod};}
}; using namespace MATRIX;
matrix a[3], b[3];
namespace TREE{
    matrix t[N<<2][3];
    int lzy[N<<2];
    void tag(int u, int x){
        if(!x) return;
        if(x == 2) swap(t[u][1], t[u][2]), swap(t[u][1], t[u][0]);
        else swap(t[u][1], t[u][0]), swap(t[u][1], t[u][2]);
        (lzy[u] += x) %= 3;
    }
    void down(int u) {tag(ls, lzy[u]), tag(rs, lzy[u]), lzy[u] = 0;}
    void build(int u, int l, int r, int *v){
        if(l == r){
            if(l & 1) rep(i, 0, 2) t[u][i] = a[(v[l]+i)%3];
            else rep(i, 0, 2) t[u][i] = b[(v[l]+i)%3];
            return;
        }
        build(ls, l, mid, v); build(rs, mid + 1, r, v);
        rep(i, 0, 2) t[u][i] = t[ls][i] * t[rs][i];
    }
    void update(int u, int l, int r, int x, int y, int val){
        if(x <= l && r <= y) return tag(u, val);
        down(u);
        if(x <= mid) update(ls, l, mid, x, y, val);
        if(y > mid) update(rs, mid + 1, r, x, y, val);
        rep(i, 0, 2) t[u][i] = t[ls][i] * t[rs][i];
    }
    matrix query(int u, int l, int r, int x, int y){
        if(x <= l && r <= y) return t[u][0];
        down(u);
        if(y <= mid) return query(ls, l, mid, x, y);
        if(x > mid) return query(rs, mid + 1, r, x, y);
        return query(ls, l, mid, x, y) * query(rs, mid + 1, r, x, y);
    }
}
using TREE::query; using TREE::update; using TREE::query; 

int n, q, v[N];
int main(){
    rep(i, 0, 2) a[i] = gen(), b[i] = inv(a[i]);
    scanf("%d%d", &n, &q);
    string s; cin >> s;
    rep(i, 1, n) v[i] = s[i-1] ^ 48;
    TREE::build(1, 1, n, v);
    while(q--){
        int op, x, y; scanf("%d%d%d", &op, &x, &y);
        if(op == 1) TREE::update(1, 1, n, x, y, 1);
        else puts(TREE::query(1, 1, n, x, y).eq() ? "Yes" : "No");
    }
    return 0;
}