#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

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

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

class BIT {
private:
	ll N;
	vector<ll> node;
public:
	BIT(ll M) {
		node = vector<ll>(M + 1, 0);
		N = M;
	}

	ll sum(ll i) {
		ll s = 0;
		while (i > 0) {
			s += node[i];
			i -= i & -i;
		}
		return s;
	}

	ll sum(ll i, ll j) {
		ll l = sum(i - 1);
		ll r = sum(j);
		return r - l;
	}

	void add(ll i, ll x) {
		while (i <= N) {
			node[i] += x;
			i += i & -i;
		}
	}

	void add0(ll i, ll x) {
		add(i + 1, x);
	}
	//[i,j)
	ll sum0(ll i, ll j) {
		return sum(i + 1, j);
	}
};

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll n, q; scanf("%lld %lld", &n, &q);
	vector<ll> a(n); for (ll i = 0; i < n; i++) scanf("%lld", &a[i]);
	BIT bit(n + 1);
    vector<ll> sa(n); 
	for (ll i = 0; i < n - 1; i++) {
		sa[i] = a[i + 1] - a[i];
		if (sa[i] != 0) bit.add0(i, 1);
	}

    while (q--) {
        ll t; scanf("%lld", &t);
        if (t == 1) {
            ll l, r, x; scanf("%lld %lld %lld", &l, &r, &x);
            l--; r--;
			if (l > 0) {
				sa[l - 1] += x;
				if (sa[l - 1] == x) bit.add0(l - 1, 1);
				if (sa[l - 1] == 0) bit.add0(l - 1, -1);
			}
			if (r < n - 1) {
				sa[r] -= x;
				if (sa[r] == -x) bit.add0(r, 1);
				if (sa[r] == 0) bit.add0(r, -1);
			}
        }
        else {
			ll l, r; scanf("%lld %lld", &l, &r);
			l--; r--;
			ll res = 1;
			if (l  < r) res += bit.sum0(l, r);
			printf("%lld\n", res);
        }
    }

	return 0;
}