import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

class lazySegTree(object):
	# N:処理する区間の長さ
	def __init__(self, N):
		self.N = N
		self.LV = (N - 1).bit_length()
		self.N0 = 2 ** self.LV
		self.data = [0] * (2 * self.N0)
		self.lazy = [0] * (2 * self.N0)

	# 遅延伝播を行うindexを生成
	def gindex(self, l, r):
		L = (l + self.N0) >> 1; R = (r + self.N0) >> 1
		lc = 0 if l & 1 else (L & -L).bit_length()
		rc = 0 if r & 1 else (R & -R).bit_length()
		for i in range(self.LV):
			if rc <= i:
				yield R
			if L < R and lc <= i:
				yield L
			L >>= 1; R >>= 1

	# 遅延伝搬処理
	def propagates(self, *ids):
		for i in reversed(ids):
			# print(ids)
			v = self.lazy[i-1]
			if not v:
				continue
			self.lazy[2 * i - 1] += v; self.lazy[2 * i] += v
			self.data[2 * i - 1] += v; self.data[2 * i] += v
			self.lazy[i - 1] = 0

	# 区間[l, r]にxを加算
	def update(self, l, r, x):
		*ids, = self.gindex(l, r)
		self.propagates(*ids)

		L = self.N0 + l; R = self.N0 + r
		while L < R:
			if R & 1:
				R -= 1
				self.lazy[R - 1] += x; self.data[R - 1] += x
			if L & 1:
				self.lazy[L - 1] += x; self.data[L - 1] += x
				L += 1
			L >>= 1; R >>= 1
		for i in ids:
			self.data[i - 1] = min(self.data[2 * i - 1], self.data[2 * i])

	# 区間[l, r]内の最小値を求める
	def query(self, l, r):
		self.propagates(*self.gindex(l, r))
		L = self.N0 + l; R = self.N0 + r

		s = INF
		while L < R:
			if R & 1:
				R -= 1
				s = min(s, self.data[R - 1])
			if L & 1:
				s = min(s, self.data[L - 1])
				L += 1
			L >>= 1; R >>= 1
		return s

class SegmentTree(object):
	#N:処理する区間の長さ
	def __init__(self, N):
		self.N0 = 2 ** (N - 1).bit_length()
		self.data = [0] * (2 * self.N0)

	#k番目の値をxに更新
	def update(self, k, x):
		k += self.N0 - 1
		self.data[k] = x
		while k > 0:
			k = (k - 1) // 2
			self.data[k] = self.data[2 * k + 1] + self.data[2 * k + 2]

	def query(self, l, r):
		L = l + self.N0; R = r + self.N0 + 1
		m = 0
		while L < R:
			if R & 1:
				R -= 1
				m = m + self.data[R - 1]
			if L & 1:
				m = m + self.data[L - 1]
				L += 1
			L >>= 1; R >>= 1

		return m

#処理内容
def main():
	N, Q = getlist()
	A = getlist()
	# セグ木初期化
	Seg = SegmentTree(N)
	for i in range(N - 1):
		if A[i] != A[i + 1]:
			Seg.update(i, 1)

	# print(Seg.data)

	lazySeg = lazySegTree(N)
	for i in range(N):
		lazySeg.update(i, i + 1, A[i])

	for i in range(Q):
		q = getlist()
		if q[0] == 1:
			l, r, x = q[1], q[2], q[3]
			l -= 1; r -= 1
			if l > 0:
				a = lazySeg.query(l - 1, l)
				b = lazySeg.query(l, l + 1)
				if a == b + x:
					Seg.update(l - 1, 0)
				if a == b:
					Seg.update(l - 1, 1)
			if r < N - 1:
				a = lazySeg.query(r, r + 1)
				b = lazySeg.query(r + 1, r + 2)
				if a + x == b:
					Seg.update(r, 0)
				if a == b:
					Seg.update(r, 1)

			lazySeg.update(l, r + 1, x)

		else:
			l, r = q[1], q[2]
			l -= 1; r -= 1
			if l == r:
				print(1)
			else:
				ans = Seg.query(l, r - 1)
				print(ans + 1)



if __name__ == '__main__':
	main()