class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(self.n+1) # 1-indexed

    def init(self, init_val):
        for i, v in enumerate(init_val):
            self.add(i, v)

    def add(self, i, x):
        # i: 0-indexed
        i += 1 # to 1-indexed
        while i <= self.n:
            self.bit[i] += x
            i += (i & -i)

    def sum(self, i, j):
        # return sum of [i, j)
        # i, j: 0-indexed
        return self._sum(j) - self._sum(i)

    def _sum(self, i):
        # return sum of [0, i)
        # i: 0-indexed
        res = 0
        while i > 0:
            res += self.bit[i]
            i -= i & (-i)
        return res

    def lower_bound(self, x):
        s = 0
        pos = 0
        depth = self.n.bit_length()
        v = 1 << depth
        for i in range(depth, -1, -1):
            k = pos + v
            if k <= self.n and s + self.bit[k] < x:
                    s += self.bit[k]
                    pos += v
            v >>= 1
        return pos

    def __str__(self): # for debug
        arr = [self.sum(i,i+1) for i in range(self.n)]
        return str(arr)

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

n, q = map(int, input().split())
A = list(map(int, input().split()))
Q = []
LR = []
for i, a in enumerate(A):
    Q.append((a, 1, i))
for i in range(q):
    t, l, r, x = map(int, input().split())
    l, r = l-1, r-1
    Q.append((x, 0, i))
    LR.append((l, r))

Q.sort(key=lambda x:(-x[0], x[1]))
bit1 = BIT(n+1)
bit2 = BIT(n+1)
ans = [0]*q
for a, t, i in Q:
    if t == 1:
        bit1.add(i, a)
        bit2.add(i, 1)
    else:
        l, r = LR[i]
        ans[i] = bit1.sum(l, r+1)-a*bit2.sum(l, r+1)
print(*ans, sep='\n')