#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define PP pair<P,P>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T,vector<T>,greater<T>>
#define vecunique(vec) sort(vec.begin(), vec.end());decltype(vec)::iterator result = std::unique(vec.begin(), vec.end());vec.erase(result, vec.end())
using namespace std;
template<class T> inline void chmax(T& a, T b) { a = max(a, b); }
template<class T> inline void chmin(T& a, T b) { a = min(a, b); }

bool prime(int x) {
	for (int i = 2; i * i <= x; i++) {
		if (x % i == 0)return false;
	}
	return x != 1;
}
int gcd(int x, int y) {
	if (y == 0)return x;
	return gcd(y, x % y);
}
int lcm(int x, int y) {
	return x / gcd(x, y) * y;
}
int kai(int x, int y) {
	int res = 1;
	for (int i = x - y + 1; i <= x; i++) {
		res *= i; res %= mod;
	}
	return res;
}
int mod_pow(int x, int y, int m) {
	int res = 1;
	while (y > 0) {
		if (y & 1) {
			res = res * x % m;
		}
		x = x * x % m;
		y >>= 1;
	}
	return res;
}
int comb(int x, int y) {
	if (y > x)return 0;
	return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int get_rand(int MIN, int MAX) {
	random_device rnd;
	mt19937_64 mt64(rnd());
	uniform_int_distribution<int>engine(MIN, MAX);
	return engine(mt64);
}
/*--------Library Zone!--------*/


struct Segtree {
	int size = 1;
	vector<int>left_, right_, lazy, ans;
	Segtree(int x) {
		while (size < x)size *= 2;
		lazy.resize(2 * size - 1);
		left_.resize(2 * size - 1);
		right_.resize(2 * size - 1);
		ans.resize(2 * size - 1);
		rep(i, 2 * size - 1) {
			left_[i] = 0; right_[i] = 0;
			ans[i] = 0; lazy[i] = 0;
		}
	}
	void eval(int k, int l, int r) {
		left_[k] += lazy[k] / (r - l);
		right_[k] += lazy[k] / (r - l);
		if (r - l > 1) {
			lazy[k * 2 + 1] += lazy[k] / 2;
			lazy[k * 2 + 2] += lazy[k] / 2;
		}
		lazy[k] = 0;
	}
	void update(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
		if (r == -1)r = size;
		if (r <= a || b <= l)return;
		if (a <= l && r <= b) {
			lazy[k] += x * (r - l);
			eval(k, l, r);
			if (!ans[k])ans[k] = 1;
			return;
		}
		eval(k, l, r);
		update(a, b, x, k * 2 + 1, l, (l + r) / 2);
		update(a, b, x, k * 2 + 2, (l + r) / 2, r);
		left_[k] = left_[k * 2 + 1];
		if (right_[k * 2 + 2])right_[k] = right_[k * 2 + 2];
		else right_[k] = right_[k * 2 + 1];
		ans[k] = ans[k * 2 + 1] + ans[k * 2 + 2] - (right_[k * 2 + 1] == left_[k * 2 + 2] && right_[k * 2 + 1]);
	}
	int query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r == -1)r = size;
		if (r <= a || b <= l)return 0;
		eval(k, l, r);
		if (a <= l && r <= b)return ans[k];
		int lval = query(a, b, k * 2 + 1, l, (l + r) / 2);
		int rval = query(a, b, k * 2 + 2, (l + r) / 2, r);
		return lval + rval - (right_[k * 2 + 1] == left_[k * 2 + 2] && right_[k * 2 + 1] && lval && rval);
	}
	int query2(int a, int k = 0, int l = 0, int r = -1) {
		if (r == -1)r = size;
		if (r - l == 1)return left_[k];
		if (a < (l + r) / 2) {
			return query2(a, k * 2 + 1, l, (l + r) / 2);
		}
		return query2(a, k * 2 + 2, (l + r) / 2, r);
	}
};
int n, q;
signed main() {
	cin >> n >> q;
	Segtree segtree(n);
	rep(i, n) {
		int a; cin >> a;
		segtree.update(i, i + 1, a);
	}
	rep(_, q) {
		int a; cin >> a;
		if (a == 1) {
			int l, r, x; cin >> l >> r >> x; l--; r--;
			segtree.update(l, r + 1, x);
		}
		else {
			int l, r; cin >> l >> r; l--; r--;
			cout << segtree.query(l, r + 1) << endl;
		}
	}
}