//階差
#include <iostream>
#define int long long
#define rep(i, n) for(i = 0; i < (n); i++)
using namespace std;

const int DEPTH = 17;
struct SegTree {
	int d[1 << (DEPTH + 1)];
	int f[1 << (DEPTH + 1)];
	SegTree() {
		int i;
		rep(i, 1 << (DEPTH + 1)) { d[i] = 0; f[i] = 0; }
	}
	void add(int pos, int x) {
		pos += (1 << DEPTH) - 1;
		d[pos] += x;
		f[pos] = (d[pos] != 0);
		while (pos > 0) {
			pos = (pos - 1) / 2;
			d[pos] = d[pos * 2 + 1] + d[pos * 2 + 2];
			f[pos] = f[pos * 2 + 1] + f[pos * 2 + 2];
		}
	}
	int fsum(int l, int r, int a = 0, int b = (1 << DEPTH), int id = 0) {
		if (a >= r || b <= l) return 0;
		if (l <= a && b <= r) return f[id];
		int x = fsum(l, r, a, (a + b) / 2, id * 2 + 1);
		int y = fsum(l, r, (a + b) / 2, b, id * 2 + 2);
		return x + y;
	}
};

int n, q;
int a[100000];
int t, l, r;
SegTree seg;

signed main() {
	int i;
	
	cin >> n >> q;
	rep(i, n) cin >> a[i];
	rep(i, n - 1) seg.add(i + 1, a[i + 1] - a[i]);	//セグ木は、1-indexed
	
	rep(i, q) {
		cin >> t >> l >> r;
		l--; r--;
		if (t == 1) {
			int x; cin >> x;
			seg.add(l, x);
			seg.add(r + 1, -x);
		}
		else {
			cout << seg.fsum(l + 1, r + 1) + 1 << endl;
		}
	}
	return 0;
}