#include <cassert>
#include <iostream>
using namespace std;
class SegTreeLazy {
    struct T { int left, right, value; };
    static const T op(const T& lhs, const T& rhs) { // binary operator***
        return { lhs.left, rhs.right, lhs.value + rhs.value + (lhs.right != rhs.left) };
    }
    // constexpr static T unit = 0; // unit***
    const int N;
    T *data;
    int *delay;
    int calc_size(int n) { int ret = 1; while (n > ret) ret *= 2; return ret; }
    void force(int i, int l, int r) {
        if (delay[i]) {
            const int x = delay[i];
            data[i] = { data[i].left + x, data[i].right + x, data[i].value }; // force***
            if (r - l > 1) {
                delay[2*i+1] += x;
                delay[2*i+2] += x;
            }
            delay[i] = 0;
        }
    }
public:
    explicit SegTreeLazy(int n) : N(calc_size(n)) {   // [0, n-1]
        data = new T[2*N-1]();
        delay = new int[2*N-1]();
    }
    ~SegTreeLazy() { delete[] data; delete[] delay; }
    int query(int a, int b, int i = -1, int l = -1, int r = -1) {
        if (i == -1) { i = 0; l = 0; r = N; }
        // if (r <= a || b <= l) return unit;
        force(i, l, r);
        if (a <= l && r <= b) return data[i].value;
        const int m = (l+r)/2;
        if (r - l == 1) return data[i].value;
        if (b <= m) return query(a, b, 2*i+1, l, m);
        if (m <= a) return query(a, b, 2*i+2, m, r);
        int v1 = query(a, b, 2*i+1, l, m),
            v2 = query(a, b, 2*i+2, m, r);
        return (data[2*i+1].right != data[2*i+2].left) + v1 + v2;
    }
    void update_range(int a, int b, int v, int i = -1, int l = -1, int r = -1) {
        if (i == -1) { i = 0; l = 0; r = N; }
        if (r <= a || b <= l) return;
        if (a <= l && r <= b) { delay[i] += v; force(i, l, r); return; }
        update_range(a, b, v, 2*i+1, l, (l+r)/2);
        update_range(a, b, v, 2*i+2, (l+r)/2, r);
        force(2*i+1, l, (l+r)/2);
        force(2*i+2, (l+r)/2, r);
        data[i] = op(data[2*i+1], data[2*i+2]);
    }
    // T get(int i) { return query(i, i+1); }
    void init(int *a, int n) {
        for (int i = 0; i < n; i++) data[i+N-1] = { a[i], a[i], 0 };
        for (int i = N-2; i >= 0; i--) data[i] = op(data[2*i+1], data[2*i+2]);
    }
};

int main() {
    int n, q; cin >> n >> q;
    SegTreeLazy st(n);
    int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
    st.init(a, n);
    while (q--) {
        int x; cin >> x;
        if (x == 1) {
            int l, r, v; cin >> l >> r >> v;
            st.update_range(l-1, r, v);
        } else {
            int l, r; cin >> l >> r;
            cout << st.query(l-1, r) + 1 << endl;
        }
    }
}