// sis puella oier
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
ll read(){
    ll xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())xx = xx * 10 + ch - '0';
    return xx * f;
}
const int N = 500100, mod = 1e9 + 7;
int qp(int x, int k){
    int ret = 1; x %= mod;
    while(k){if (k & 1)ret = 1ll * ret * x % mod; x = 1ll * x * x % mod; k >>= 1;}
    return ret;
}
int n, q;
char c[N];
struct mat{
    int a[2][2];
};
mat get(mat x){
    int a = x.a[0][0], b = x.a[0][1];
    return mat{a, b, (1 + mod - a * a % mod) % mod * qp(b, mod - 2) % mod, mod-a};
}
mat ze, E, mt[3];
void initmat(){
    ze = {0, 0, 0, 0}, E = {1, 0, 0, 1};
    mt[0] = {998244353, 12514341}; mt[0] = get(mt[0]);
    mt[1] = {56264, 3416667}; mt[1] = get(mt[1]);
    mt[2] = {89652542, 6799343}; mt[2] = get(mt[2]);
}
mat operator * (mat x, mat y){
    mat ret = ze;
    for (int i = 0; i <= 1; ++i)for (int j = 0; j <= 1; ++j)for (int k = 0; k <= 1; ++k)
        (ret.a[i][j] += 1ll * x.a[i][k] * y.a[k][j] % mod) %= mod;
    return ret;
}
bool operator == (mat x, mat y){
    for (int i = 0; i <= 1; ++i)for (int j = 0; j <= 1; ++j)if (x.a[i][j] != y.a[i][j])return false;
    return true;
}
mat tr[N << 2][3];
int a[N], lt[N << 2];
void up(int x){
    for (int i = 0; i <= 2; ++i)tr[x][i] = tr[x << 1][i] * tr[x << 1 | 1][i];
}
void build(int x, int l, int r){
    if (l == r){
        for (int i = 0; i <= 2; ++i)tr[x][i] = mt[(a[l] + i) % 3];
        return ;
    }
    int mid = (l + r) >> 1;
    build(x << 1, l, mid), build(x << 1 | 1, mid + 1, r);
    up(x);
}
void doit(int x, int val){
    val %= 3;
    if (val == 1)swap(tr[x][0], tr[x][2]), swap(tr[x][0], tr[x][1]);
    else if (val == 2)swap(tr[x][0], tr[x][1]), swap(tr[x][0], tr[x][2]);
    (lt[x] += val) %= 3;
}
void down(int x){
    if (lt[x] != 0)doit(x << 1, lt[x]), doit(x << 1 | 1, lt[x]), lt[x] = 0;
}
void upd(int x, int l, int r, int nl, int nr){
    if (nl <= l && r <= nr){
        doit(x, 1); return ;
    }
    int mid = (l + r) >> 1; down(x);
    if (nl <= mid)upd(x << 1, l, mid, nl, nr);
    if (nr > mid)upd(x << 1 | 1, mid + 1, r, nl, nr);
    up(x);
}
mat query(int x, int l, int r, int nl, int nr){
    if (nl <= l && r <= nr)return tr[x][0];
    int mid = (l + r) >> 1; down(x);
    if (nr <= mid)return query(x << 1, l, mid, nl, nr);
    if (nl > mid)return query(x << 1 | 1, mid + 1, r, nl, nr);
    return query(x << 1, l, mid, nl, nr) * query(x << 1 | 1, mid + 1, r, nl, nr);
}
signed main(){
    n = read(), q = read();
    scanf("%s", c + 1); initmat();
    for (int i = 1; i <= n; ++i)a[i] = c[i] - '0';
    build(1, 1, n);
    int op, l, r;
    while(q--){
        op = read(), l = read(), r = read();
        if (op == 1)upd(1, 1, n, l, r);
        else if (query(1, 1, n, l, r) == E)printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}