#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 1e9 + 9, mod2 = 1e9 + 7, mod3 = 19260817;
    ll ksm(ll p, ll h, ll mod){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 5e5 + 5;
int n, q;
char s[N];
mt19937 rnd(1231241234);
struct matrix{
	ll mod;
    int c[2][2];
    void clr(){mst(c, 0);}
    void init(){mst(c, 0), c[0][0] = c[1][1] = 1;}
    matrix operator*(const matrix b)const{
        matrix x; x.clr(), x.mod = mod;
        _rep(i, 0, 1) _rep(j, 0, 1){
            _rep(k, 0, 1) x.c[i][j] = (x.c[i][j] + 1ll * c[i][k] * b.c[k][j] % mod) % mod;
        }
        return x;
    }
    bool check(){
        return c[0][0] == 1 && c[0][1] == 0 && c[1][0] == 0 && c[1][1] == 1;
    }
};
struct hashtable{
	ll mod;
    matrix A[3][2];
    void init(ll _mod){
    	mod = _mod;
        _rep(i, 0, 2){
            ll a = rnd() % mod, b = rnd() % mod, c = rnd() % mod, d = rnd() % mod;
            A[i][0].clr(), A[i][1].clr(), A[i][0].mod = A[i][1].mod = mod;
            A[i][0].c[0][0] = a, A[i][0].c[0][1] = b, A[i][0].c[1][0] = c, A[i][0].c[1][1] = d;
            ll cur = ksm((a * d % mod - b * c % mod + mod) % mod, mod - 2, mod);
            A[i][1].c[0][0] = d * cur % mod, A[i][1].c[0][1] = (mod - b) * cur % mod, A[i][1].c[1][0] = (mod - c) * cur % mod, A[i][1].c[1][1] = a * cur % mod;
            matrix T = A[i][0] * A[i][1];
//            debug("(%d,%d)(%d,%d)\n", T.c[0][0], T.c[0][1], T.c[1][0], T.c[1][1]);
        }
    }
    matrix tr[N << 2][3];
    int tag[N << 2];
    #define ls x << 1
    #define rs x << 1 | 1
    void update(int x){
        _rep(i, 0, 2){
            tr[x][i] = tr[ls][i] * tr[rs][i];
        }
    }
    void pushtag(int x, int val){
        matrix cur[3] = {tr[x][0], tr[x][1], tr[x][2]};
        _rep(i, 0, 2) tr[x][i] = cur[(i + val) % 3];
        tag[x] = (tag[x] + val) % 3;
    }
    void pushdown(int x){
        if(!tag[x]) return;
        pushtag(ls, tag[x]), pushtag(rs, tag[x]);
        tag[x] = 0;
    }
    void build(int x, int l, int r){
        if(l == r){
            _rep(i, 0, 2){
                int c = (s[l] - '0' + i) % 3;
                tr[x][i] = A[c][l & 1];
            }
            return;
        }
        int mid = l + r >> 1;
        build(ls, l, mid), build(rs, mid + 1, r);
        update(x);
    }
    void modify(int x, int l, int r, int L, int R, int val){
        if(l >= L && r <= R) return pushtag(x, val);
        int mid = l + r >> 1;
        pushdown(x);
        if(L <= mid) modify(ls, l, mid, L, R, val);
        if(R > mid) modify(rs, mid + 1, r, L, R, val);
        update(x);
    }
    matrix query(int x, int l, int r, int L, int R){
        if(l >= L && r <= R) return tr[x][0];
        int mid = l + r >> 1;
        pushdown(x);
        if(R <= mid) return query(ls, l, mid, L, R);
        if(L > mid) return query(rs, mid + 1, r, L, R);
        return query(ls, l, mid, L, R) * query(rs, mid + 1, r, L, R);
    }
    bool query(int l, int r){
        return query(1, 1, n, l, r).check();
    }
}hsh1, hsh2;

int main(){
    hsh1.init(mod), hsh2.init(mod2);
    read(n, q), scanf("%s", s + 1);
    hsh1.build(1, 1, n), hsh2.build(1, 1, n);
    while(q--){
        int opt, l, r; read(opt, l, r);
        if(opt == 1){
            hsh1.modify(1, 1, n, l, r, 1);
            hsh2.modify(1, 1, n, l, r, 1);
        }
        if(opt == 2){
            if(hsh1.query(l, r) && hsh2.query(l, r)) puts("Yes");
            else puts("No");
        }
    }
    return 0;
}