#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
using ll = long long;
ll n,t[200010] = {},mx = 100000000000000;
void built(){
	for(int i = n-1;i>0;i--){
		t[i] = t[i<<1] + t[i<<1|1];
	}
}

void update(ll p,ll a){
	for(t[p+=n] = a;p>1;p >>= 1){
		t[p>>1] = t[p] + t[p^1];
	}
}

ll query(int l, int r){
	ll mn = 1;
	for(l += n, r += n; l<r; l >>= 1,r >>= 1){
		if(l&1) mn += t[l++];
		if(r&1) mn += t[--r];
	}
	return mn;
}

void write(){
	int i;
	cout << endl;
	for(i=1;i<=10;i++){
		cout << t[i] << " ";
		if(i==1 || i==3 || i==7){
			cout << endl;
		}
	}
	cout << endl;
}
ll a[100010];
int main(){
	int i,j,q;
	cin >> n >> q;
	for(i=0;i<n;i++){
		cin >> a[i];
	}
	n--;
	for(i=0;i<n;i++){
		a[i] = a[i] - a[i + 1];
	}
	for(i=0;i<n;i++){
		if(a[i]!=0) t[i + n] = 1;
	}
	built();
	for(i=0;i<q;i++){
		//write();
		int x,y,l,r;
		cin >> y >> l >> r;
		l--; r--;
		if(y==1){
			cin >> x;
			if(l>0){
				a[l - 1] -= x;
				update(l - 1,(a[l - 1]!=0));
			}
			a[r] += x; update(r,(a[r]!=0));
		}else{
			cout << query(l,r) << endl;
		}
	}
	//write();
}