class Bit:
    def __init__(self, n):
        self.size = n
        self.n0 = 1 << (n.bit_length() - 1)
        self.tree = [0] * (n + 1)
    
    def range_sum(self, l, r):
        return self.sum(r - 1) - self.sum(l - 1)
        
    def sum(self, i):
        i += 1
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
        
    def get(self, i):
        return self.sum(i) - self.sum(i - 1)
 
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i
         
    def lower_bound(self, x):
        pos = 0
        plus = self.n0
        while plus > 0:
            if pos + plus <= self.size and self.tree[pos + plus] < x:
                x -= self.tree[pos + plus]
                pos += plus
            plus //= 2
        return pos

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

cnt = Bit(n)
tot = Bit(n)
B.append((1 << 50, -1))
t = 0
ans = [0] * Q
for x, l, r, i in query:
    while B[t][0] < x:
        tot.add(B[t][1], B[t][0])
        cnt.add(B[t][1], 1)
        t += 1

    cn = cnt.range_sum(l, r)
    to = tot.range_sum(l, r)
    ans[i] = to + (r - l - cn) * x

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