class BIT:
    def __init__(self, n):
        self.n = n; self.k = [0]*(n+1)
    def a(self, i, x):
        while i <= self.n: self.k[i] += x; i += i&-i
    def s(self, i):
        t = 0
        while i > 0: t += self.k[i]; i -= i&-i
        return t
    def r(self, l, r): return self.s(r)-self.s(l-1)
n, q = map(int, input().split())
a = list(map(int, input().split()))
lrmpxi = []
vxset = set(a)
for i in range(q):
    l, r, x = map(int, input().split())
    lrmpxi.append((l-2, -1, x, i))
    lrmpxi.append((r-1, 1, x, i))
    vxset.add(x)
vxtoi = {vx: i+1 for i, vx in enumerate(sorted(vxset))}
bit_sum = BIT(n+q+1)
bit_num = BIT(n+q+1)
j = -1
ans = [0]*q
for lr, mp, x, i in sorted(lrmpxi):
    while j < lr:
        j += 1
        v = a[j]
        bit_sum.a(vxtoi[v], v)
        bit_sum.a(n+q+1, -v)
        bit_num.a(1, 1)
        bit_num.a(vxtoi[v], -1)
    ans[i] += mp*(bit_sum.s(vxtoi[x])+x*bit_num.s(vxtoi[x]))
print(*ans, sep="\n")