from bisect import bisect_left
from operator import add


class SegmentTree():
    def __init__(self, n, unit, f, A=None):
        self.s = 2**(n-1).bit_length()
        self.size = 2*self.s
        self.node = [unit]*self.size
        self.op = f
        self.UNIT = unit
        if A:
            for i in range(n):
                self.node[self.s+i] = A[i]
            for i in range(self.s-1, -1, -1):
                self.node[i] = self.op(self.node[2*i], self.node[2*i+1])

    def update(self, i, v):
        i += self.s
        self.node[i] = v
        while i > 0:
            i >>= 1
            self.node[i] = self.op(self.node[2*i], self.node[2*i+1])

    def get(self, l, r):
        vl, vr = self.UNIT, self.UNIT
        l += self.s
        r += self.s
        while l < r:
            if l & 1:
                vl = self.op(self.node[l], vl)
                l += 1
            if r & 1:
                r -= 1
                vr = self.op(vr, self.node[r])
            l >>= 1
            r >>= 1
        return self.op(vl, vr)


N, Q = map(int, input().split())
A = list(map(int, input().split()))
B = [list(map(int, input().split())) for _ in range(Q)]
X = [b[2] for b in B]
X.sort()
M = len(X)
Y = [[] for _ in range(M+1)]
Z = [[] for _ in range(M)]
for i in range(Q):
    l, r, x = B[i]
    l -= 1
    ind = bisect_left(X, x)
    Z[ind].append([i, l, r])
for i, a in enumerate(A):
    ind = bisect_left(X, a)
    Y[ind].append([i, a])

st1 = SegmentTree(N, 0, add)
st2 = SegmentTree(N, 0, add, [1]*N)

ans = [0]*Q
for i in range(M):
    for ind, a in Y[i]:
        st1.update(ind, a)
        st2.update(ind, 0)
    x = X[i]
    for ind, l, r in Z[i]:
        ans[ind] = st1.get(l, r)+st2.get(l, r)*x

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