#include <bits/stdc++.h>

template < typename T >
inline void read(T &cnt) {
    cnt = 0; char ch = getchar(); bool op = 1;
    for (; ! isdigit(ch); ch = getchar())
        if (ch == '-') op = 0;
    for (; isdigit(ch); ch = getchar())
        cnt = cnt * 10 + ch - 48;
    cnt = op ? cnt : - cnt;
}

// const long long mod = 68718952447;
const long long mod = 998244353;
const int N = 2e5 + 5;
const long long X = 13331;

// inline long long quick_mul(long long a, long long b) {
//     long long ret = 0;
//     for (; b; b >>= 1) {
//         if (b & 1) ret = (ret + a) % mod;
//         a = (a + a) % mod;
//     }
//     return ret;
// }

inline long long quick_pow(long long a, long long b) {
    long long ret = 1;
    for (; b; b >>= 1) {
        if (b & 1) ret = ret * a % mod;
        a = a * a % mod;
    }
    return ret;
}

int n, q, a[N];
long long tagt[N * 4], tagx[N * 4];

struct sgt {
    long long t, x, ex;
} T[N * 4];

inline void upd(int p) {
    T[p].t = T[p * 2].t + T[p * 2 + 1].t;
    T[p].x = (T[p * 2].x + T[p * 2 + 1].x) % mod;
    T[p].ex = (T[p * 2].ex + T[p * 2 + 1].ex) % mod;
}

inline void build(int p, int l, int r) {
    tagt[p] = 0;
    tagx[p] = 1;
    if (l == r) {
        T[p].t = a[l];
        long long val = quick_pow(X, a[l]);
        T[p].x = val;
        T[p].ex = quick_pow(val, mod - 2);
        return;
    }
    int mid = (l + r) / 2;
    build(p * 2, l, mid);
    build(p * 2 + 1, mid + 1, r);
    upd(p);
}

inline void psd(int p, int l, int r) {
    int mid = (l + r) / 2;
    // [l, mid] + [mid + 1, r]
    T[p * 2].t += tagt[p] * (mid - l + 1);
    T[p * 2 + 1].t += tagt[p] * (r - mid);
    tagt[p * 2] += tagt[p];
    tagt[p * 2 + 1] += tagt[p];
    tagt[p] = 0;

    T[p * 2].x = T[p * 2].x * tagx[p] % mod;
    T[p * 2 + 1].x = T[p * 2 + 1].x * tagx[p] % mod; 

    T[p * 2].ex = T[p * 2].ex * quick_pow(tagx[p], mod - 2) % mod;
    T[p * 2 + 1].ex = T[p * 2 + 1].ex * quick_pow(tagx[p], mod - 2) % mod; 

    tagx[p * 2] = tagx[p * 2] * tagx[p] % mod;
    tagx[p * 2 + 1] = tagx[p * 2 + 1] * tagx[p] % mod;

    tagx[p] = 1;
}

inline void modify(int p, int l, int r, int x, int y, int v) {
    if (l >= x && r <= y) {
        T[p].t += 1ll * (r - l + 1) * v;
        long long val = quick_pow(X, v);
        T[p].x = (T[p].x * val) % mod;
        T[p].ex = (T[p].ex * quick_pow(val, mod - 2));
        tagt[p] += v;
        tagx[p] = tagx[p] * val % mod;
        return;
    }

    psd(p, l, r);

    int mid = (l + r) / 2;
    if (x <= mid) modify(p * 2, l, mid, x, y, v);
    if (y > mid) modify(p * 2 + 1, mid + 1, r, x, y, v);
    upd(p);
}


inline sgt query(int p, int l, int r, int x, int y) {
    if (l >= x && r <= y)
        return T[p];

    psd(p, l, r);
    sgt sum = {0, 0, 0};
    int mid = (l + r) / 2;
    if (x <= mid) sum = query(p * 2, l, mid, x, y);
    if (y > mid) {
        sgt sum2 = query(p * 2 + 1, mid + 1, r, x, y);
        sum.t += sum2.t;
        sum.x = (sum.x + sum2.x) % mod;
        sum.ex = (sum.ex + sum2.ex) % mod;
    }
    return sum;
}

inline void solve() {
    read(n), read(q);
    for (int i = 1; i <= n; ++ i)
        read(a[i]);
    build(1, 1, n);

    while (q --) {
        int op, l, r, v;
        read(op), read(l), read(r);
        if (op == 1) {
            read(v);
            modify(1, 1, n, l, r, v);
        }

        else {
            sgt Q = query(1, 1, n, l, r);
            // std::cout << Q.t << '\n';
            Q.t *= 2;
            if (Q.t % (r - l + 1) != 0) std::cout << "No\n";
            else {
                long long m = Q.t / (r - l + 1);
                // std::cout << Q.x << ' ' << Q.ex * quick_pow(X, m) % mod << '\n';
                if (Q.x == Q.ex * quick_pow(X, m) % mod)
                    std::cout << "Yes\n";
                else std::cout << "No\n";
            }
        }
    }
}

int main() {
    // int t; read(t);
    int t = 1;
    while (t --) solve();
    return 0;
}