mod = 998244353


def main():
    import sys
    input = sys.stdin.buffer.readline

    class Bit:
        def __init__(self, n):
            self.size = n
            self.tree = [0] * (n + 1)

        def sum(self, i):
            if i == 0:
                return 0
            s = 0
            while i > 0:
                s += self.tree[i]
                i -= i & -i
            return s

        def add(self, i, x):
            while i <= self.size:
                self.tree[i] += x
                i += i & -i

        def lower_bound(self, w):
            if w <= 0:
                return 0
            x = 0
            k = 1 << (self.size.bit_length() - 1)
            while k:
                if x + k <= self.size and self.tree[x + k] < w:
                    w -= self.tree[x + k]
                    x += k
                k >>= 1
            return x + 1

    N, Q = map(int, input().split())
    A = list(map(int, input().split()))
    query = []
    for q in range(Q):
        l, r, x = map(int, input().split())
        query.append((x, l, r, q))

    for i, a in enumerate(A):
        query.append((a, i+1))
    query.sort(key=lambda z: z[0])

    bit_val = Bit(N)
    bit_num = Bit(N)
    ans = [0] * Q
    for line in query:
        if len(line) == 2:
            a, i = line
            bit_num.add(i, 1)
            bit_val.add(i, a)
        else:
            x, l, r, q = line
            num = bit_num.sum(r) - bit_num.sum(l-1)
            ans[q] = bit_val.sum(r) - bit_val.sum(l - 1) + x * (r - l + 1 - num)
    print(*ans, sep="\n")


if __name__ == '__main__':
    main()