#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;


/********************************
 *
 * 平方分割
 *
 *******************************/
class SquareRootDecomposition {
public:
    vector<int> S; // 少ない方
    vector<int> SQ; // 1の合計
    vector<int> T; // 多い方
    int K;
    
    SquareRootDecomposition(int size) {
        K = sqrt(size);
        T = vector<int>(size+K, 0);
        S = vector<int>(size/K+1, 0);
        SQ = vector<int>(size/K+1, 0);
    }
    
    int query(int l, int r) {
        int ret = 1;
        while(l < r) {
            int lk = l / K;
            int rk = r / K;
            if (lk == rk) {
                FOR(j, l, r) {
                    ret += cal(j);
                }
            }
            else if (l % K == 0) {
                ret += SQ[lk];
            }
            else {
                FOR(j, l, (lk+1)*K) {
                    ret += cal(j);
                }
            }
            l = (lk+1)*K;
        }
        return ret;
    }
    
    int get(int i) {
        return T[i] + S[i/K];
    }
    
    int cal(int i) {
        return get(i) != get(i+1);
    }
    
    void updateSQ(int lk) {
        SQ[lk] = 0;
        REP(i,K) SQ[lk] += cal(lk*K+i);
    }
    
    void add(int l, int r, int w) {
        int lk0 = (l-1)/K;
        int rk0 = (r-1)/K;
        while(l < r) {
            int lk = l / K;
            int rk = r / K;
            if (lk == rk) {
                FOR(j, l, r) {
                    T[j] += w;
                }
            }
            else if (l % K == 0) {
                S[lk] += w;
            }
            else {
                FOR(j, l, (lk+1)*K) {
                    T[j] += w;
                }
            }
            l = (lk+1)*K;
        }
        updateSQ(lk0);
        updateSQ(rk0);
    }
};

void solve() {
    cin>>N>>Q;
    
    auto S = SquareRootDecomposition(N);
    int a;
    REP(i,N) {
        cin>>a;
        S.add(i,i+1,a);
    }
    int c,l,r,x;
    REP(i,Q) {
        cin >> c;
        if (c==1) {
            cin>>l>>r>>x;
            S.add(l-1,r,x);
        }else {
            cin>>l>>r;
            out("%lld\n", S.query(l-1, r-1));
        }
    }
}