#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct SegTree {
	std::vector<int> data; // sum
	int n;
	SegTree (const std::vector<int> &a) {
		for (n = 1; n < (int) a.size(); n *= 2);
		data.resize(2 * n);
		for (int i = 0; i < (int) a.size(); i++) data[i + n] = !!a[i];
		for (int i = n - 1; i; i--) data[i] = data[i << 1] + data[i << 1 | 1];
	}
	void add(int i, int val) {
		for (i += n; i; i >>= 1) data[i] += val;
	}
	int sum(int l, int r) {
		int res = 0;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (r & 1) res += data[--r];
			if (l & 1) res += data[l++];
		}
		return res;
	}
};

int main() {
	int n = ri();
	int q = ri();
	std::vector<int> a(n);
	for (int i = 0; i < n; i++) a[i] = ri();
	std::vector<int> sub(n - 1);
	for (int i = 0; i + 1 < n; i++) sub[i] = a[i + 1] - a[i];
	SegTree tree(sub);
	for (int i = 0; i < q; i++) {
		int t = ri();
		int l = ri() - 1, r = ri() - 1;
		if (t == 1) {
			int x = ri();
			if (l) {
				sub[l - 1] += x;
				if (sub[l - 1] == x) tree.add(l - 1, 1);
				else if (sub[l - 1] == 0) tree.add(l - 1, -1);
			}
			if (r + 1 < n) {
				sub[r] -= x;
				if (sub[r] == -x) tree.add(r, 1);
				else if (sub[r] == 0) tree.add(r, -1);
			}
		} else {
			if (l == r) puts("1");
			else printf("%d\n", tree.sum(l, r) + 1);
		}
	}
	return 0;
}