#include <iostream>
#include <vector>
#include <functional>

template <class T>
struct SegmentTree {
    using Merger = std::function<T(T, T)>;

    int length;
    std::vector<T> dat;
    T unit;
    Merger merge;

    SegmentTree() = default;

    SegmentTree(int n, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        while (length < n) length <<= 1;
        dat.assign(length * 2, unit);
    }

    template <class Container>
    SegmentTree(const Container& elems, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        int n = elems.size();
        while (length < n) length <<= 1;

        dat.assign(length * 2, unit);

        std::copy(elems.begin(), elems.end(), dat.begin() + length);

        for (int nidx = length - 1; nidx >= 1; --nidx) {
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    void update(int nidx, const T& elem) {
        nidx += length;
        dat[nidx] = elem;

        while (nidx > 0) {
            nidx >>= 1;
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    T fold(int ql, int qr) const {
        ql = std::max(ql, 0);
        qr = std::min(qr, length);
        ql += length, qr += length;

        T lacc = unit, racc = unit;
        while (ql < qr) {
            if (ql & 1) {
                lacc = merge(lacc, dat[ql]);
                ++ql;
            }
            if (qr & 1) {
                --qr;
                racc = merge(dat[qr], racc);
            }
            ql >>= 1, qr >>= 1;
        }

        return merge(lacc, racc);
    }

    T get(int idx) const { return dat[idx + length]; }
    T fold_all() const { return dat[1]; }
};

using lint = long long;

void solve() {
    int n, q;
    std::cin >> n >> q;

    std::vector<lint> ds(n - 1);
    {
        lint px;
        std::cin >> px;

        for (int i = 0; i < n - 1; ++i) {
            lint x;
            std::cin >> x;
            ds[i] = x - px;
            px = x;
        }
    }

    SegmentTree<int>
        seg(n - 1, 0, [](auto a, auto b) { return a + b; });
    for (int i = 0; i < n - 1; ++i) seg.update(i, ds[i] != 0);

    while (q--) {
        int t;
        std::cin >> t;

        switch (t) {
            case 1: {
                int l, r;
                lint x;
                std::cin >> l >> r >> x;
                --l, --r;

                if (l > 0) {
                    ds[l - 1] -= x;
                    seg.update(l - 1, ds[l - 1] != 0);
                }
                if (r < n - 1) {
                    ds[r] += x;
                    seg.update(r, ds[r] != 0);
                }
                break;
            }

            case 2: {
                int l, r;
                std::cin >> l >> r;
                --l, --r;

                std::cout << seg.fold(l, r) + 1 << "\n";
                break;
            }
        }
    }
}

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

    solve();

    return 0;
}