class BIT:
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
 
    def build(self, list):
        self.tree[1:] = list.copy()
        for i in range(self.size+1):
            j = i + (i & (-i))
            if j < self.size+1:
                self.tree[j] += self.tree[i]

    def sum(self, i):
        # [0, i) の要素の総和を返す
        s = 0
        while i>0:
            s += self.tree[i]
            i -= i & -i
        return s
    # 0 index を 1 index に変更  転倒数を求めるなら1を足していく
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    # 総和がx以上になる位置のindex をbinary search
    def bsearch(self,x):
        le = 0
        ri = 1<<(self.size.bit_length()-1)
        while ri > 0:
            if le+ri <= self.size and self.tree[le+ri]<x:
                x -= self.tree[le+ri]
                le += ri
            ri >>= 1
        return le+1


n,q = map(int,input().split())
A = list(map(int,input().split()))
Q = []
for i in range(q):
    l,r,x = map(int,input().split())
    Q.append([i,l,r,x])

ans = [0]*q

bit_sum = BIT(n+5)
bit_num = BIT(n+5)

SA = [[a,i+1] for i,a in enumerate(A)]
SA.sort()
Q.sort(key=lambda x: x[3])

now = 0

for ind,l,r,x in Q:

    while now < n and SA[now][0] <= x:
        a,i = SA[now]
        bit_sum.add(i,a)
        bit_num.add(i,1)
        now += 1

    num = bit_num.sum(r+1)-bit_num.sum(l)
    count = bit_sum.sum(r+1)-bit_sum.sum(l) + (r-l+1-num)*x 
    # print(l,r,x,num,count,now)
    ans[ind] = count

for i in ans:
    print(i)