#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
ll delta[105000];
int N, Q;
int a[105000];
struct SegmentTree {
private:
    int n;
    vector<int> node;
 
public:
    SegmentTree() {
        int sz = 100050;
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, 0);
        for(int i=0; i<sz; i++) node[i+n-1] = 0;
        for(int i=n-2; i>=0; i--) node[i] = min(node[2*i+1], node[2*i+2]);
    }
 
    void update(int x, int val) {
        x += (n - 1);
        node[x] = val;
        while(x > 0) {
            x = (x - 1) / 2;
            node[x] = (node[2*x+1] + node[2*x+2]);
        }
    }
    // hannkaikukann 
    int getsum(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        if(r <= a || b <= l) return 0;
        if(a <= l && r <= b) return node[k];
 
        int vl = getsum(a, b, 2*k+1, l, (l+r)/2);
        int vr = getsum(a, b, 2*k+2, (l+r)/2, r);
        return (vl + vr);
    }
};


int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> Q;
    for(int i = 1; i <= N; i++) cin >> a[i];
    for(int i = 1; i <= N - 1; i++) {
        delta[i] = a[i+1] - a[i];
    }
    SegmentTree seg;
    for(int i = 1; i <= N - 1; i++) {
        if(delta[i] != 0) {
            seg.update(i, 1);
        }
    }
    while(Q--) {
        int ope;
        cin >> ope;
        if(ope == 2) {
            int l, r;
            cin >> l >> r;
            int ans = seg.getsum(l, r) + 1;
            cout << ans << endl;
            continue;
        } else if(ope == 1) {
            int l, r, x;
            cin >> l >> r >> x;
            if(l > 1) {
                delta[l-1] += x;
                if(delta[l-1] == 0) {
                    seg.update(l-1, 0);
                } else {
                    seg.update(l-1, 1);
                }
            }
            if(r < N) {
                delta[r] -= x;
                if(delta[r] == 0) {
                    seg.update(r, 0);
                } else {
                    seg.update(r, 1);
                }
            }
        }
    }
    return 0;
}