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

typedef long long ll;
typedef pair<ll,ll> P;

#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

struct LazySegmentTree {
private:
    int n;
    vector<ll> node,lazy;
public:
    LazySegmentTree(vector<ll> v) {
        int sz = v.size();
        n = 1;
        while (n < sz) n *= 2;
        node.resize(2*n-1);
        lazy.resize(2*n-1,0);
        for (int i = 0;i < sz;++i) node[i+n-1] = v[i];
        for (int i = n-2;i >= 0;--i) node[i] = node[i*2+1]+node[i*2+2];
    }

    void eval(int k,int l,int r) {
        if (lazy[k] != 0) {
            node[k] += lazy[k];
            if (r-l > 1) {
                lazy[2*k+1] += lazy[k]/2;
                lazy[2*k+2] += lazy[k]/2;
            }
            lazy[k] = 0;
        }
    }

    void add(int a,int b,ll x,int k = 0,int l = 0,int r = -1) {
        if (r < 0) r = n;
        eval(k,l,r);
        if (b <= l || r <= a) return;
        if (a <= l && r <= b) {
            lazy[k] += (r-l)*x;
            eval(k,l,r);
        } else {
            add(a,b,x,2*k+1,l,(l+r)/2);
            add(a,b,x,2*k+2,(l+r)/2,r);
            node[k] = node[2*k+1]+node[2*k+2];
        }
    }

    ll getsum(int a,int b,int k = 0,int l = 0,int r = -1) {
        if (r < 0) r = n;
        if (b <= l || r <= a) return 0;
        eval(k,l,r);
        if (a <= l && r <= b) return node[k];
        ll vl = getsum(a,b,k*2+1,l,(l+r)/2);
        ll vr = getsum(a,b,2*k+2,(l+r)/2,r);
        return vl+vr;
    }
};

int main() {
    int n,q;
    cin >> n >> q;
    vector<ll> a(n);
    for (int i = 0;i < n;++i) scanf("%lld",&a[i]);
    LazySegmentTree val(a),ans(vector<ll>(n,0));
    for (int i = 0;i < n-1;++i) if (a[i] != a[i+1]) ans.add(i,i+1,1);
    for (int z = 0;z < q;++z) {
        int c,l,r,x;
        cin >> c >> l >> r;
        if (c == 1) {
            cin >> x;
            val.add(l-1,r,x);
            ll l1,l2,r1,r2;
            if (l > 1) {
                l1 = val.getsum(l-2,l-1);
                r1 = val.getsum(l-1,l);
                if (l1 == r1-x) ans.add(l-2,l-1,1);
                else if (l1 == r1) ans.add(l-2,l-1,-1);
            }
            if (r < n) {
                l2 = val.getsum(r-1,r);
                r2 = val.getsum(r,r+1);
                if (l2-x == r2) ans.add(r-1,r,1);
                else if (l2 == r2) ans.add(r-1,r,-1);
            }
        } else {
            cout << ans.getsum(l-1,r-1)+1 << "\n";
        }
    }
    return 0;
}