N, Q = map(int,input().split())
A = list(map(int,input().split()))
queries = [list(map(int,input().split())) for _ in range(Q)]

B = [A[i+1] - A[i] for i in range(N-1)]
M = N-1

# C[k] : 1 (B[k] != 0) 0 (B[k] == 0)

# N: 処理する区間の長さ
N0 = 2**(M-1).bit_length()
INF = 2**31-1
data = [0]*(2*N0)

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

# 区間[l, r)の総和
def query(l, r):
    L = l + N0; R = r + N0
    s = 0
    while L < R:
        if R & 1:
            R -= 1
            s += data[R-1]
        if L & 1:
            s += data[L-1]
            L += 1
        L >>= 1; R >>= 1
    return s

# 配列の初期化
for i, b in enumerate(B):
    update(i, b != 0)

for line in queries:
    if len(line) == 4:
        q, l, r, x = line
        l -= 1
        r -= 1
        if l != 0:
            B[l-1] += x
            update(l-1, B[l-1] != 0)
        if r != M:
            B[r] -= x
            update(r, B[r] != 0)
    elif len(line) == 3:
        q, l, r = line
        l -= 1
        r -= 1
        ans = query(l, r) + 1
        print(ans)