#include <bits/stdc++.h>

using namespace std;
using LL = long long;
using ll = long long;

constexpr int mod = 65536;
constexpr int N = 5E5 + 10;

#define ls u << 1
#define rs u << 1 | 1

struct segtree {
    static constexpr LL mod[] = {998244353, 1000000007};
    static constexpr LL base[] = {99999, 88888};
    static inline LL pw[N][2];

    static void init() {
        pw[0][0] = pw[0][1] = 1;
        for (int t = 0; t < 2; t++) {
            for (int i = 1; i < N; i++) {
                pw[i][t] = pw[i - 1][t] * base[t] % mod[t];
            }
        }
    }

    struct info {
        int siz = 0;
        array<LL, 2> hash = {};
        LL sum = 0;
        info operator+(const info &p) {
            array<LL, 2> res;
            for (int t = 0; t < 2; t++) {
                res[t] = hash[t] * (pw[p.siz][t]) + p.hash[t];
                res[t] %= mod[t];
            }
            return {siz + p.siz, res, (sum + p.sum) % ::mod};
        }
    };

    int n, p, dep;
    vector<info> io;

    segtree(int _n, vector<int> &v) {
        n = _n;
        p = __bit_ceil(n + 2);
        io.assign(2 * p + 1, {});
        for (int i = 1; i <= n; i++) {
            io[p + i].siz = 1;
            io[p + i].hash[0] = io[p + i].hash[1] = v[i];
            io[p + i].sum = v[i];
        }
        for (int i = p - 1; i >= 1; i--) {
            pushup(i);
        }
    }

    void pushup(int u) {
        io[u] = io[ls] + io[rs];
    }

    void cg(int i, int v) {
        for (int t = 0; t < 2; t++) {
            io[i + p].hash[t] += v + ::mod;
            io[i + p].hash[t] %= ::mod;
        }
        io[i + p].sum += v + ::mod;
        io[i + p].sum %= ::mod;
        for (int j = (i + p) >> 1; j; j >>= 1) {
            pushup(j);
        }
    }

    info qy(int l, int r) {
//        cerr << "QUERY " << l << " " << r << " :\n ";
        info sml, smr;
        for (l += p - 1, r += p + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {
            if (~l & 1) sml = sml + io[l ^ 1];
            if (r & 1) smr = io[r ^ 1] + smr;
        }
        // info res = sml + smr;
//        cerr << "HASH " << res.hash[0] << " " << res.hash[1] << "\n";
//        cerr << "SUM " << res.sum << "\n";
//        cerr << "\n";
        return sml + smr;
    }
};

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);
    int n, q;
    cin >> n >> q;

    segtree::init();
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = n; i >= 1; i--) {
        a[i] = a[i] - a[i - 1] + mod;
        a[i] %= mod;
    }

//    cerr << "\n";
//    for (int i = 1; i <= n; i++) {
//        cerr << a[i] << " \n"[i == n];
//    }

    segtree tr(n, a);

    for (int i = 1; i <= q; i++) {
        int op;
        cin >> op;
        if (op == 1) {
            int l, r;
            cin >> l >> r;
            tr.cg(l, 1);
            if (r + 1 <= n) tr.cg(r + 1, -1);
        } else {
            int x, y, L;
            cin >> x >> y >> L;
            bool is = 1;
            is &= (tr.qy(1, x).sum == tr.qy(1, y).sum);
            is &= (tr.qy(x + 1, x + L - 1).hash == tr.qy(y + 1, y + L - 1).hash);
            if (is) {
                cout << "yes" << "\n";
            } else {
                cout << "no" << "\n";
            }
       }
    }
    return 0;
}

/*
5 6
1 2 1 2 1
2 1 2 2
2 1 3 3
1 1 1
1 3 5
2 1 2 4
2 1 2 2


3 2
0 65535 65535
1 2 3
2 1 2 2

 */