#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

template<typename T> class LazyRSQ {
    public:
    int n;
    T inf = INT_MAX;
    vector<T> data, lazy, f, f_lazy;
    
    LazyRSQ(int m, T init_value=INT_MAX){
        // 2のべき乗にする
        n = 1;
        while(n < m) n <<= 1;
        data.assign(2*n-1, init_value);
        lazy.assign(2*n-1, 0);
        f.assign(2*n-1, 0);
        for(int i=0;i<m;++i) {
            f[n-1+i] = 1;
        }
        inf = init_value;
    }

    void eval(int k, int kl, int kr){
        if(data[k] == inf) data[k] = 0;
        if(lazy[k] == 0) return;
        data[k] += lazy[k];
        if(kr - kl > 1){
            lazy[2*k+1] += lazy[k];
            lazy[2*k+2] += lazy[k];
        }
        lazy[k] = 0;
    }

    // [s,t)
    void add(int s, int t, T x, int k, int kl, int kr){
        eval(k, kl, kr);
        if(kr <= s || t <= kl) return;
        if(s <= kl && kr <= t){
            lazy[k] += x;
            eval(k, kl, kr);
            return;
        }
        int kc = (kl+kr)/2;
        add(s, t, x, 2*k+1, kl, kc);
        add(s, t, x, 2*k+2, kc, kr);
        f[k] = f[2*k+1] + f[2*k+2];
        if(data[n-1+kc-1] == data[n-1+kc]) --f[k];
    }

    void add(int s, int t, T x) {
        add(s, t, x, 0, 0, n);
    }

    // [s,t)
    T find(int s, int t, int k, int kl, int kr){
        eval(k, kl, kr);
        if(kr <= s || t <= kl) return 0;
        if(s <= kl && kr <= t) return f[k];
        int kc = (kl+kr)/2;
        T vl = find(s, t, 2*k+1, kl, kc);
        T vr = find(s, t, 2*k+2, kc, kr);
        T ret = vl + vr;
        if(data[n-1+kc-1] == data[n-1+kc]) --ret;
        f[k] = ret;
        // cerr << "find(" << kl << ", " << kr << ") = " << ret << endl; 
        return ret;
    }

    T find(int s, int t) {
        return find(s, t, 0, 0, n);
    }
};


int main() {
    std::ios::sync_with_stdio(false); cin.tie(0);
    int n, q, query, l, r;
    ll a;
    cin >> n >> q;
    LazyRSQ<ll> tree(n);
    for(int i=0;i<n;++i) {
        cin >> a;
        tree.add(i, i+1, a);
    }

    for(int i=0;i<q;++i) {
        cin >> query >> l >> r;
        --l; --r;
        if(query == 1) {
            cin >> a;
            tree.add(l, r+1, a);
        } else {
            cout << tree.find(l, r+1) << endl;
        }
    }

}