import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class BitSum:
    def __init__(self, n):
        self._n = n+1
        self._table = [0]*self._n

    def add(self, i, x):
        if x == 0: return
        i += 1
        while i < self._n:
            self._table[i] += x
            i += i & -i

    def sum(self, r):
        res = 0
        while r > 0:
            res += self._table[r]
            r -= r & -r
        return res

    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r)
        return self.sum(r)-self.sum(l)

    # return "min(i) of sum(a[0]..a[i])>=x" or "N"
    def bisect(self, x):
        idx = 0
        d = 1 << (self._n-1).bit_length()-1
        while d:
            if idx|d < self._n and self._table[idx|d] < x:
                idx |= d
                x -= self._table[idx]
            d >>= 1
        return idx

from collections import defaultdict

n,q=LI()
aa=LI()
a2i=defaultdict(list)
ss=BitSum(n)
cc=BitSum(n)
for i,a in enumerate(aa):
    a2i[a].append(i)
    ss.add(i,a)
    cc.add(i,1)

xlr=[]
for qi in range(q):
    l,r,x=LI()
    xlr.append((x,l-1,r,qi))

xlr.sort(key=lambda x:-x[0])
ans=[0]*q
for a in sorted(a2i):
    while xlr and xlr[-1][0]<=a:
        x,l,r,qi=xlr.pop()
        s=ss.sumlr(l,r)
        c=cc.sumlr(l,r)
        ans[qi]=s+x*(r-l-2*c)
    for i in a2i[a]:
        cc.add(i,-1)
        ss.add(i,-2*a)
while xlr:
    x,l,r,qi=xlr.pop()
    s=ss.sumlr(l,r)
    c=cc.sumlr(l,r)
    ans[qi]=s+x*(r-l-2*c)

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