import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
# Binary Indexed Tree (Fenwick Tree)
# 0-indexed
class BIT:
    def __init__(self, n):
        self.n = n
        self.data = [0]*(n+1)
        self.el = [0]*(n+1)
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s
    def add(self, i, x):
        assert 0 <= i < self.n
        i = i+1
        self.el[i] += x
        while i <= self.n:
            self.data[i] += x
            i += i & -i
    def set(self, i, x):
        assert 0 <= i <= self.n
        self.add(i,x-self.get(i))
    def get(self, i, j=None):# j=Noneのときiを取得, [i, j)の和を取得
        if j is None:
            return self.el[i+1]
        return self.sum(j) - self.sum(i)


n, q = na()
a = na()
s = list(a)

event = []


for i in range(q):
    l,r,x = na()
    event.append((l-1,0,x, i))
    event.append((r-1,2,x, i))
    s.append(x)

s = sorted(set(s))

d = {x:i for i, x in enumerate(s)}
m = len(s)
bit1 = BIT(m)
bit2 = BIT(m)

for i in range(n):
    event.append((i, 1, a[i]))
ans = [0] * q
for eve in sorted(event):
    if eve[1] == 0:
        x = eve[2]
        i = eve[3]
        ans[i] -= bit2.get(0, d[x]) + x * bit1.get(d[x], m)
    elif eve[1] == 1:
        x = eve[2]
        bit1.add(d[x], 1)
        bit2.add(d[x], x)
    else:
        x = eve[2]
        i = eve[3]
        ans[i] += bit2.get(0, d[x]) + x * bit1.get(d[x], m)
    """print(eve)
    for j in range(m):
        print(bit1.get(j),end = " ")
    print()
    for j in range(m):
        print(bit2.get(j),end = " ")
    print()
    print(*ans)"""
for i in ans:
    print(i)