#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

template<typename Abel> struct BIT {
    const Abel UNITY_SUM = 0;
    vector<Abel> dat;
    BIT(int n) : dat(n, UNITY_SUM) { }  // [0, n)
    inline void add(int i, Abel x) {
        while (i < dat.size()) { dat[i] += x; i |= i + 1; }
    }
    inline Abel sum(int i) {    // [0, i]
        Abel res = UNITY_SUM;
        while (i >= 0) { res += dat[i]; i = (i & (i + 1)) - 1; }
        return res;
    }
    inline Abel sum(int a, int b) { return sum(b - 1) - sum(a - 1); }   // [a, b)
    Abel operator[](int i) { return sum(i, i + 1); }
    friend ostream& operator<<(ostream& os, BIT<Abel> &bit) {
        for (int i = 0; i < bit.dat.size(); i++) os << bit[i] << " ";
        return os;
    }
};

int main() {
    int n, q; cin >> n >> q;
    vector<int> diff(n + 1);
    for (int i = 1; i <= n; i++) {
        int a; cin >> a;
        diff[i - 1] -= a; diff[i] += a;
    }
    BIT<int> bit(n + 1);
    for (int i = 0; i <= n; i++) bit.add(i, diff[i] != 0);
    while (q--) {
        int com; cin >> com;
        if (com == 1) {
            int l, r, x; cin >> l >> r >> x;
            l--;
            bit.add(l, -bit[l]);
            diff[l] -= x;
            bit.add(l, diff[l] != 0);
            bit.add(r, -bit[r]);
            diff[r] += x;
            bit.add(r, diff[r] != 0);
        } else {
            int l, r; cin >> l >> r;
            cout << bit.sum(l, r) + 1 << endl;
        }
    }
    return 0;
}