class FenwickTree:
    def __init__(self, n: int):
        self.data = [0] * (n+10)
        self.n = (n+10)

    def add(self, p: int, x: int):
        assert 0 <= p < self.n
        p += 1
        while p < len(self.data):
            self.data[p] += x
            p += p & -p

    def sum(self, p: int) -> int:
        """区間 [0, p] の和"""
        assert 0 <= p < self.n
        p += 1
        s = 0
        while p > 0:
            s += self.data[p]
            p -= p & -p
        return s

    def rangesum(self, l: int, r: int) -> int:
        """区間 [l, r] の和"""
        assert 0 <= l <= r < self.n
        s = self.sum(r)
        if l > 0:
            s -= self.sum(l-1)
        return s


DATA = 0
QUERY = 1

N, Q = map(int, input().split())
A = list(map(int, input().split()))

events = []
for i, a in enumerate(A):
    events.append((a, DATA, i))

for i in range(Q):
    L, R, X = map(int, input().split())
    L -= 1
    R -= 1
    events.append((X, QUERY, L, R, i))

ft = FenwickTree(N)
freq = FenwickTree(N)
events.sort()
ans = [0] * Q
for e in events:
    if e[1] == DATA:
        x, p = e[0], e[2]
        ft.add(p, x)
        freq.add(p, 1)
    elif e[1] == QUERY:
        x, l, r, qi = e[0], e[2], e[3], e[4]
        s = ft.rangesum(l, r)
        cnt = (r-l+1) - freq.rangesum(l, r)
        ans[qi] = s + cnt * x

print(*ans, sep='\n')