#BIT plus ver
class BITplus:
    def __init__(self,N):
        self.N = N
        self.bit = [0] * (self.N+1)
    def add(self,i,x):
        while i <= self.N:
            self.bit[i] += x
            i += i & -i
    def fold(self,i):
        ans = 0
        while i > 0:
            ans += self.bit[i]
            i -= i & -i
        return ans
    def lb(self,w):
        if w <= 0:return 0
        x = 0
        k = 1
        while k <= self.N:
            k <<= 1
        k >>= 1
        while k:
            if x + k <= self.N and self.bit[x+k] < w:
                w -= self.bit[x+k]
                x += k
            k >>= 1
        return x + 1

    #サイズ N の配列をいれる
    def build(self,seq):
        bit = self.bit
        N = self.N
        for i in range(N):
            bit[i+1] = seq[i]
        for i in range(1,N+1):
            if i + (i & -1) <= N:
                bit[i + (i & -i)] += bit[i]

N,Q = map(int,input().split())
A = list(map(int,input().split()))
B = [(A[i],i) for i in range(N)]
B.sort(reverse = True)
query = []
querysub = []
for i in range(Q):
    l,r,x, = map(int,input().split())
    query.append((l,r))
    querysub.append((x,i))
querysub.sort()
ans = [0] * Q
bit = BITplus(N)
bitn = BITplus(N)
for x,i in querysub:
    l,r = query[i]
    while B and B[-1][0] <= x:
        a,j = B.pop()
        bit.add(j+1,a)
        bitn.add(j+1,1)
    s = bit.fold(r) - bit.fold(l-1)
    n = bitn.fold(r) - bitn.fold(l-1)
    ans[i] = s + (r - l + 1 - n) * x
for a in ans:
    print(a)