#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P ,P> PP;
constexpr ll MOD = ll(1e9) + 7;
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(1e5) + 5;
constexpr double EPS = 1e-8;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rbegin(), (v).rend())
#define ALL(v) (v).begin(), (v).end()



template <typename Monoid, typename OperatorMonoid>
struct LazySegmentTree{
private:
    using F = function<Monoid(Monoid, Monoid)>;  // 要素と要素を結合させる関数
    using G = function<Monoid(Monoid, OperatorMonoid)>;  // 要素に作用素を作用させる関数
    using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;  // 作用素と作用素を結合させる関数
    using P = function<OperatorMonoid(OperatorMonoid, int)>;  // 作用素を作用させる区間の長さによって変化させる関数
    int N;
    vector<Monoid> node;
    vector<OperatorMonoid> lazy;
    F f;
    G g;
    H h;
    P p;
    Monoid e;  // identity element
    OperatorMonoid oe;  // identity element

public:
    LazySegmentTree(){}
    LazySegmentTree(F f, G g, H h, Monoid e, OperatorMonoid oe, P p=[](OperatorMonoid a, int b){return a;}):f(f), g(g), h(h), e(e), oe(oe), p(p){}
    void init(int sz){
        N = 1;
        while(N < sz) N <<= 1;
        node.assign(2*N-1, e);
        lazy.assign(2*N-1, oe);
    }
    void build(vector<Monoid>& v){
        int sz = int(v.size());
        init(sz);
        for(int i=0; i<sz; i++){
            node[i+N-1] = v[i];
        }
        for(int i=N-2; i>=0; i--){
            node[i] = f(node[i*2+1], node[i*2+2]);
        }
    }
    void eval(int k, int len){
        if(lazy[k] != oe){
            node[k] = g(node[k], p(lazy[k], len));
            if(k < N-1){
                lazy[2*k+1] = h(lazy[2*k+1], lazy[k]);
                lazy[2*k+2] = h(lazy[2*k+2], lazy[k]);
            }
            lazy[k] = oe;
        }
    }
    Monoid update(int a, int b, OperatorMonoid x){return update(a, b, x, 0, 0, N);}
    Monoid update(int a, int b, OperatorMonoid x, int k, int l, int r){
        eval(k, r-l);
        if(b <= l || r <= a) return node[k];
        if(a <= l && r <= b){
            lazy[k] = h(lazy[k], x);
            return g(node[k], p(lazy[k], r-l));
        }
        return node[k] = f(update(a,b,x,2*k+1,l,(l+r)/2), update(a,b,x,k*2+2,(l+r)/2,r));
    }
    // [a,b)
    Monoid query(int a, int b){return query(a, b, 0, 0, N);}
    Monoid query(int a, int b, int k, int l, int r){
        eval(k, r-l);
        if(b <= l || r <= a) return e;
        if(a <= l && r <= b) return node[k];
        Monoid vl, vr;
        vl = query(a, b, 2*k+1, l, (l+r)/2);
        vr = query(a, b, 2*k+2, (l+r)/2, r);
        return f(vl, vr);
    }
};

int main() {
    int n, q;
    cin >> n >> q;
    vector<P3> a(n);
    for(int i=0;i<n;i++){
        ll x;
        cin >> x;
        a[i] = P3(0,{x,x});
    }
    auto f = [](P3 x, P3 y){
        return P3(x.first+y.first+((x.second.second != y.second.first && x.second.second != -1 && y.second.second != -1) ? 1:0),{x.second.first, y.second.second});
    };
    auto g = [](P3 x, ll y){
        ll lhs = (x.second.first!=-1 ? x.second.first+y : -1);
        ll rhs = (x.second.second!=-1 ? x.second.second+y : -1);
        return P3(x.first,{lhs,rhs});
    };
    auto h = [](ll x, ll y){return x+y;};
    LazySegmentTree<P3,ll> seg(f,g,h,P3(0,{-1,-1}),0);
    seg.build(a);
    for(int i=0;i<q;i++){
        ll c, l ,r, x;
        cin >> c >> l >> r;
        l--;
        if(c == 1){
            cin >> x;
            seg.update(l,r,x);
        }
        else{
            cout << seg.query(l,r).first+1 << endl;
        }
    }
    return 0;
}