/*
[templates]: 
duipai
spjdp
compre
addhis
floor_sum
treedfs
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e18;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(time(0)); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int mod = 998244353, N = 500000; 
int qpow(int x, int k) {
    int res = 1; 
    while(k) {
        if(k & 1) res = res * x % mod;
        x = x * x % mod; 
        k >>= 1; 
    }
    return res; 
}
struct matrix {
    int a[2][2]; 
    matrix() {
        memset(a, 0, sizeof a); 
    }
    matrix inv() {
        matrix res; 
        int hls = a[0][0] * a[1][1] - a[1][0] * a[0][1]; 
        hls %= mod; if(hls < 0) hls += mod;
        int inv = qpow(hls, mod - 2); 
        res.a[0][0] = a[1][1]; 
        res.a[0][1] = (mod - a[0][1]); 
        res.a[1][0] = (mod - a[1][0]); 
        res.a[1][1] = a[0][0]; 
        (res.a[0][0] *= inv) %= mod; 
        (res.a[0][1] *= inv) %= mod; 
        (res.a[1][0] *= inv) %= mod; 
        (res.a[1][1] *= inv) %= mod; 
        return res; 
    }
    bool operator== (matrix op) {
        f(i, 0, 1) f(j, 0, 1) if(a[i][j] != op.a[i][j]) return 0; 
        return 1; 
    }
    matrix operator* (matrix op) {
        matrix res; 
        f(i, 0, 1) f(k, 0, 1) f(j, 0, 1) {
            (res.a[i][j] += a[i][k] * op.a[k][j]) %= mod; 
        }
        return res; 
    }
}e, v[3], iv[3];   
int a[N + 10]; 
inline int id(int l, int r) {return (l + r) | (l != r); }
array<matrix, 3> sgt[2 * N + 10]; 
void build(int now, int l, int r) {
    if(l == r) {
        f(i, 0, 2) {
            sgt[now][i] = (l & 1 ? v[(a[l] + i) % 3] : iv[(a[l] + i) % 3]); 
        }
        return; 
    }
    int mid = (l + r) >> 1; 
    build(id(l, mid), l, mid); 
    build(id(mid + 1, r), mid + 1, r); 
    f(i, 0, 2) {
        sgt[now][i] = sgt[id(l, mid)][i] * sgt[id(mid + 1, r)][i]; 
    }
    return; 
}
array<matrix, 3> nxt(array<matrix, 3> th, int x) {
    array<matrix, 3> res; 
    f(i, 0, 2) res[i] = th[(i + x) % 3]; 
    return res; 
} 
int tag[2 * N + 10]; 
void pushdown(int now, int l, int r) {
    if(tag[now] != 0) {
        int mid = (l + r) >> 1; 
        sgt[id(l, mid)] = nxt(sgt[id(l, mid)], tag[now]); 
        sgt[id(mid + 1, r)] = nxt(sgt[id(mid + 1, r)], tag[now]);
        (tag[id(l, mid)] += tag[now]) %= 3;  
        (tag[id(mid + 1, r)] += tag[now]) %= 3; 
        tag[now] = 0;  
    }
}
matrix query(int now, int l, int r, int x, int y) {
    if(l >= x && r <= y) {
        return sgt[now][0]; 
    }
    if(l > y || r < x) {
        return e; 
    }
    int mid = (l + r) >> 1;
    pushdown(now, l, r);  
    return query(id(l, mid), l, mid, x, y) * query(id(mid + 1, r), mid + 1, r, x, y); 
}
void add(int now, int l, int r, int x, int y) {
    if(l >= x && r <= y) {
        sgt[now] = nxt(sgt[now], 1); 
        tag[now] ++; if(tag[now] >= 3) tag[now] -= 3; 
        return; 
    }
    if(l > y || r < x) return; 
    int mid = (l + r) >> 1; 
    pushdown(now, l, r); 
    add(id(l, mid), l, mid, x, y); 
    add(id(mid + 1, r), mid + 1, r, x, y);
    f(i, 0, 2) {
        sgt[now][i] = sgt[id(l, mid)][i] * sgt[id(mid + 1, r)][i]; 
    }
    return; 
}
signed main() { 
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen();
    //freopen();
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int n, q; cin >> n >> q; f(i, 0, 1) e.a[i][i] = 1; 
    f(i, 0, 2) {
        f(j, 0, 1) f(k, 0, 1) v[i].a[j][k] = rnd(0, mod - 1);
        // cerr << "i = " << i << endl; 
        // f(j, 0, 1) f(k, 0, 1) cerr << v[i].a[j][k] << " \n"[k == 1]; 
        iv[i] = v[i].inv();  
        // f(j, 0, 1) f(k, 0, 1) cerr << iv[i].a[j][k] << " \n"[k == 1]; 
    }
    // f(i, 0, 2) {
        // assert(iv[i] * v[i] == e); 
    // }
    
    f(i, 1, n) {
        char ch; cin >> ch;
        a[i] = ch - '0'; 
    }
    build(id(1, n), 1, n); 
    f(i, 1, q) {
        int op, l, r; cin >> op >> l >> r; 
        if(op == 1) {
            add(id(1, n), 1, n, l, r); 
        }
        else {
            matrix res = query(id(1, n), 1, n, l, r);
            if(res == e) {
                cout << "Yes\n"; 
            }
            else {
                cout << "No\n"; 
            }
        }
    }
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}