class Bit:
    def __init__(self, n):
        self.size = n
        self.n0 = 1 << (n.bit_length() - 1)
        self.tree = [0] * (n + 1)
    
    def range_sum(self, l, r):
        return self.sum(r - 1) - self.sum(l - 1)
        
    def sum(self, i):
        i += 1
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
        
    def get(self, i):
        return self.sum(i) - self.sum(i - 1)
 
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i
         
    def lower_bound(self, x):
        pos = 0
        plus = self.n0
        while plus > 0:
            if pos + plus <= self.size and self.tree[pos + plus] < x:
                x -= self.tree[pos + plus]
                pos += plus
            plus //= 2
        return pos


n, Q = map(int, input().split())
A = list(map(int, input().split()))
bit1 = Bit(n + 1)
bit2 = Bit(n)
for i, a in enumerate(A):
    bit1.add(i, a)
    bit1.add(i + 1, -a)
for i in range(n - 1):
    if A[i] != A[i + 1]:
        bit2.add(i, 1)
for _ in range(Q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        l, r, x = query[1:]
        if l != 1:
            a0 = bit1.sum(l - 2)
            a1 = bit1.sum(l - 1)
            if a0 != a1:
                bit2.add(l - 2, -1)
        if r != n:
            a0 = bit1.sum(r - 1)
            a1 = bit1.sum(r)
            if a0 != a1:
                bit2.add(r - 1, -1)
        bit1.add(l - 1, x)
        bit1.add(r, -x)
        if l != 1:
            a0 = bit1.sum(l - 2)
            a1 = bit1.sum(l - 1)
            if a0 != a1:
                bit2.add(l - 2, 1)
        if r != n:
            a0 = bit1.sum(r - 1)
            a1 = bit1.sum(r)
            if a0 != a1:
                bit2.add(r - 1, 1)
    else:
        l, r = query[1:]
        ans = bit2.range_sum(l - 1, r - 1) + 1
        print(ans)