from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N,Q = map(int,input().split())
A = list(map(int,input().split()))

class SegTree:
    """
    Segment Tree
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        初期化

        init_val: 配列の初期値
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新

        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る

        l: index(0-index)
        r: index(0-index)
        """
        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res
        
        
S = list(accumulate([0]+A))
query = [tuple(map(int,input().split())) for _ in range(Q)]

T = SegTree([(A[i],i) for i in range(N)],max,(-1,-1))
U = SegTree([0]*N,lambda x,y:x+y,0)
V = SegTree([0]*N,lambda x,y:x+y,0)

X = [(x,l,r) for l,r,x in query]
X.sort(reverse=True)
ans = defaultdict(int)
for i in range(Q):
    x,l,r = X[i]
    t = (l,r,x)
    
    while T.query(0,N)[0] >= x:
        j = T.query(0,N)[1]
        V.update(j,A[j])
        U.update(j,1)
        T.update(j,(-1,-1))
    l -= 1
    
    tans = S[r]-S[l] - V.query(l,r) + x*U.query(l,r)
    ans[t] = tans
for q in query:
    print(ans[q])