#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define subnb true
#define Lnb true
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define ls(x) x * 2 + 1
#define rs(x) x * 2 + 2

typedef long long ll;
const int N = (int)5e5 + 50;
int INF = (int)1e9 + 50;
const int MOD = (int)1e9 + 7;


struct mat {
    ll a[2][2];
};

mat mul(mat a, mat b) {
    mat c = {{{0, 0}, {0, 0}}};
    rep(i, 0, 2) {
        rep(j, 0, 2) {
            rep(k, 0, 2) {
                c.a[i][j] += a.a[i][k] * b.a[k][j];
                c.a[i][j] %= MOD;
            }
        }
    }
    return c;
}


struct node {
    mat mt[3];
    int add;
    void add_val(int d) {
        add += d;
        add %= 3;
        mat nmt[3];
        rep(i, 0, 3) nmt[i] = mt[(i - d % 3 + 3) % 3];
        rep(i, 0, 3) {
            mt[i] = nmt[i];
        }
    }

    void merge(node &ls, node &rs) {
        rep(i, 0, 3) {
            mt[i] = mul(ls.mt[i], rs.mt[i]);
        }
    }
};

mat omt[3] = {
        {{{(-11), -8}, {15, 11}}},
        {{{3, 4}, {-2, -3}}},
        {{{13, -28}, {6, -13}}},
};

struct Tree {
    node dat[4 * N];

    void push_down(int x, int l, int r) {
        if(dat[x].add) {
            if(l < r) {
                dat[ls(x)].add_val(dat[x].add);
                dat[rs(x)].add_val(dat[x].add);
            }
            dat[x].add = 0;
        }
    }

    void init(int x, int l, int r, int *a) {
        if(l == r) {
            rep(i, 0, 3) {
                dat[x].mt[(((a[l] - i) % 3) + 3) % 3] = omt[i];
            }
//            cout << l << ", " << r << ": ";
//            rep(i, 0, 2) {
//                rep(j, 0, 2) cout << dat[x].mt[0].a[i][j] << " ";
//            }
            dat[x].add = 0;
            return ;
        }
        int mid = (l + r) / 2;
        init(ls(x), l, mid, a);
        init(rs(x), mid + 1, r, a);
        dat[x].add = 0;
        dat[x].merge(dat[ls(x)], dat[rs(x)]);
//        cout << l << ", " << r << ": ";
//        rep(i, 0, 2) {
//            rep(j, 0, 2) cout << dat[x].mt[0].a[i][j] << " ";
//        }
//        cout << endl;
    }

    mat query(int a, int b, int x, int l, int r) {
        int mid = (l + r) / 2;
        if(r < a || l > b) return {{{1, 0}, {0, 1}}};

        push_down(x, l, r);

        if(l >= a && r <= b) return dat[x].mt[0];

        return mul(query(a, b, ls(x), l, mid), query(a, b, rs(x), mid+1, r));
    }

    void update(int a, int b, int x, int l, int r, int delta) {
        int mid = (l + r) / 2;
        if(r < a || l > b) return ;

        push_down(x, l, r);

        if(l >= a && r <= b) {
            dat[x].add_val(delta);
            return ;
        }

        update(a, b, ls(x), l, mid, delta);
        update(a, b, rs(x), mid+1, r, delta);

        dat[x].merge(dat[ls(x)], dat[rs(x)]);
    }
} tree;

int n, q;
string str;
int a[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> q;
    cin >> str;
    rep(i, 0, n) {
        a[i] = str[i] - '0';
//        cout << i << ": " << a[i] << endl;
    }
    tree.init(0, 0, n - 1, a);
    while(q--) {
        int tp, l, r; cin >> tp >> l >> r; l--, r--;
        if(tp == 1) {
            tree.update(l, r, 0, 0, n - 1, 1);
        } else {
            mat mt = tree.query(l, r, 0, 0, n - 1);
            rep(i, 0, 2) {
                rep(j, 0, 2) {
                    mt.a[i][j] += MOD;
                    mt.a[i][j] %= MOD;
//                    %= MOD;
                }
            }
            int res = mt.a[0][0] == 1 && mt.a[1][1] == 1 && mt.a[1][0] == 0 && mt.a[0][1] == 0;
            cout << (res ? "Yes" : "No") << '\n';
        }
    }

}