## https://yukicoder.me/problems/no/876

class BinaryIndexTree:
    """
    フェニック木(BinaryIndexTree)の基本的な機能を実装したクラス
    """
    def __init__(self, size):
        self.size = size
        self.array = [0] * (size + 1)
    
    def add(self, x, a):
        index = x
        while index <= self.size:
            self.array[index] += a
            index += index & (-index)
    
    def sum(self, x):
        index = x
        ans = 0
        while index > 0:
            ans += self.array[index]
            index -= index & (-index)
        return ans

    def least_upper_bound(self, value):
        if self.sum(self.size) < value:
            return -1
        elif value <= 0:
            return 0

        m = 1
        while m < self.size:
            m *= 2

        k = 0
        k_sum = 0
        while m > 0:
            k0 = k + m
            if k0 < self.size:
                if k_sum + self.array[k0] < value:
                    k_sum += self.array[k0]
                    k += m
            m //= 2
        if k < self.size:
            return k + 1
        else:
            return -1

def main():
    N, Q = map(int, input().split())
    A = list(map(int, input().split()))
    querirs = []
    for _ in range(Q):
        values = list(map(int, input().split()))
        querirs.append(values)
    
    diff_array = []
    prev = A[0]
    for i in range(N - 1):
        diff_array.append(A[i + 1] - prev)
        prev = A[i + 1]

    bit = BinaryIndexTree(N - 1)
    for i in range(N - 1):
        bit.add(i + 1, (1 if diff_array[i] != 0 else 0))
    
    for query in querirs:
        if query[0] == 1:
            l, r, b = query[1:]
            l -= 1
            r -= 1
            if l > 0:
                old_diff = diff_array[l - 1]
                diff_array[l - 1] += b
                new_diff = diff_array[l - 1]
                bit.add(l, (-1 if old_diff != 0 else 0))
                bit.add(l, (1 if new_diff != 0 else 0))

            if r < N - 1:
                old_diff = diff_array[r]
                diff_array[r] -= b
                new_diff = diff_array[r]
                bit.add(r + 1, (-1 if old_diff != 0 else 0))
                bit.add(r + 1, (1 if new_diff != 0 else 0))

        else:
            l, r = query[1:]
            l -= 1
            r -= 1
            if l == r:
                print(1)
            else:
                s = bit.sum(r) - bit.sum(l)
                print(s + 1)
    


    



if __name__ == "__main__":
    main()