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

const int N = 5e5 + 10;
const ll base = 1e9 + 7;
const ll MOD = 998244353998244347ll;

ll pw[N], preSum[N], a[N];

struct SegmentTree{
    ll tag[N << 2], maxs[N << 2], Hash[N << 2];

    void push_down(int o, int lenL, int lenR) {
        if(tag[o]){
            tag[o << 1] += tag[o];
            tag[o << 1 | 1] += tag[o];
            maxs[o << 1] += tag[o];
            maxs[o << 1 | 1] += tag[o];
            (Hash[o << 1] += preSum[lenL - 1]) %= MOD;
            (Hash[o << 1 | 1] += preSum[lenR - 1]) %= MOD;
            tag[o] = 0;
        }
    }

    void push_up(int o, int lenL, int lenR) {maxs[o] = max(maxs[o << 1], maxs[o << 1 | 1]), Hash[o] = (((__int128)Hash[o << 1] * pw[lenR]) + Hash[o << 1 | 1]) % MOD;}

    void build(int o, int l, int r) {
        if(l == r) return maxs[o] = Hash[o] = a[l], []{}();
        int mid = (l + r) >> 1;
        build(o << 1, l, mid);
        build(o << 1 | 1, mid + 1, r);
        push_up(o, mid - l + 1, r - mid);
        // cerr << "o: " << o << " " << l << " " << r << " " << Hash[o] << " " << maxs[o] << "\n";
    }

    void modifyAdd(int o, int l, int r, int L, int R) {
        if(L <= l && r <= R) return ++ tag[o], ++ maxs[o], (Hash[o] += preSum[r - l]) %= MOD, []{}();
        int mid = (l + r) >> 1;
        push_down(o, mid - l + 1, r - mid);
        if(mid >= L) modifyAdd(o << 1, l, mid, L, R);
        if(mid < R) modifyAdd(o << 1 | 1, mid + 1, r, L, R);
        push_up(o, mid - l + 1, r - mid);
    }

    void cover(int o, int l, int r) {
        if(maxs[o] < 65536) return;
        if(l == r) return tag[o] = maxs[o] = Hash[o] = 0, []{}();
        int mid = (l + r) >> 1;
        push_down(o, mid - l + 1, r - mid);
        cover(o << 1, l, mid); cover(o << 1 | 1, mid + 1, r);
        push_up(o, mid - l + 1, r - mid);
    }

    pair<ll, int> queryHash(int o, int l, int r, int L, int R) {
        if(L <= l && r <= R) return {Hash[o], r - l + 1};
        int mid = (l + r) >> 1;
        pair<ll, int>re1 = {0, 0}, re2 = {0, 0};
        push_down(o, mid - l + 1, r - mid);
        if(mid >= L) re1 = queryHash(o << 1, l, mid, L, R);
        if(mid < R) re2 = queryHash(o << 1 | 1, mid + 1, r, L, R);
        return {((__int128)re1.first * pw[re2.second] + re2.first) % MOD, re1.second + re2.second};
    }
}Sgtree;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n, q; cin >> n >> q;

    pw[0] = preSum[0] = 1;
    for (int i = 1; i <= n; ++ i) pw[i] = (__int128)pw[i - 1] * base % MOD, preSum[i] = (preSum[i - 1] + pw[i]) % MOD;
    
    for (int i = 1; i <= n; ++ i) cin >> a[i];
    Sgtree.build(1, 1, n);

    // for (int i = 1; i <= n; ++ i) cerr << Sgtree.queryHash(1, 1, n, i, i).first << "\n";
    for (int i = 1; i <= q; ++ i){
        int op, x, y, L, l, r;
        cin >> op;
        switch (op)
        {
            case 1:
                cin >> l >> r;
                Sgtree.modifyAdd(1, 1, n, l, r);
                Sgtree.cover(1, 1, n);
                break;
            
            default:
                cin >> x >> y >> L;
                cout << (Sgtree.queryHash(1, 1, n, x, x + L - 1) == Sgtree.queryHash(1, 1, n, y, y + L - 1) ? "yes\n" : "no\n");
                break;
        }
    }
}