class BIT:
    def __init__(self, A):
        self.size = len(A)
        self.bit = [0]*(len(A)+1)
        for i in range(len(A)):
            self.add(i, A[i])

    def sum(self, i):
        i += 1
        ans = 0
        while i > 0:
            ans += self.bit[i]
            i -= -i&i
        return ans
    
    def query(self, l, r):
        if l == 0:
            return self.sum(r-1)
        else:
            return self.sum(r-1)-self.sum(l-1)
    
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.bit[i] += x
            i += -i&i

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

query = sorted([(i, l-1, r-1, x) for i, (l, r, x) in enumerate(query)], key=lambda x:x[3])
A = sorted(enumerate(A), key=lambda x:x[1])
ans = [0]*Q
F = BIT([0]*N)
FC = BIT([0]*N)
idx = 0
for qidx, l, r, x in query:
    while idx < N and A[idx][1] <= x:
        F.add(A[idx][0], A[idx][1])
        FC.add(A[idx][0], 1)
        idx += 1
    ans[qidx] += x*FC.query(l, r+1)-F.query(l, r+1)
F = BIT([0]*N)
FC = BIT([0]*N)
idx = N-1
for qidx, l, r, x in query[::-1]:
    while 0 <= idx and x <= A[idx][1]:
        F.add(A[idx][0], A[idx][1])
        FC.add(A[idx][0], 1)
        idx -= 1
    ans[qidx] += F.query(l, r+1)-x*FC.query(l, r+1)

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