# coding: utf-8
# Your code here!
"""
セグメント木（一般化）
"""
from operator import add
class segment_tree:
    """
    N: 処理する区間の長さ
    """
    def __init__(self, N):
        #演算子および単位元を定義する。
        # max, min, add,ラムダ式,関数定義...
        self.op = add
        self.UNIT = 0
        
        
        self.N0 = 2**(N-1).bit_length()
        self.tree = [self.UNIT]*(2*self.N0)
        
    # a_k の値を x に更新
    def update(self, k,x):
        k += self.N0-1
        self.tree[k] = x
        while k >= 0:
            k = (k - 1) // 2
            self.tree[k] = self.op(self.tree[2*k+1], self.tree[2*k+2])
    # 区間[l,r]をopでまとめる
    def query(self, l,r):
        L = l + self.N0; R = r + self.N0 + 1 
        s = self.UNIT
        while L < R:
            if R & 1:
                R -= 1
                s = self.op(s, self.tree[R-1])
            if L & 1:
                s = self.op(s, self.tree[L-1])
                L += 1
            L >>= 1; R >>= 1
        return s
    def get(self, k): #k番目の値を取得。query[k,k]と同じ
        return self.tree[k+self.N0-1]

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline

n,q = [int(i) for i in readline().split()]
a = [int(i) for i in readline().split()]
ilrx = [[int(i) for i in readline().split()]+[i] for i in range(q)]


seg = segment_tree(n)
num = segment_tree(n)

from operator import itemgetter
ilrx.sort(key = itemgetter(3), reverse=True)

ans = [0]*q
idx = 0

z = sorted(range(n), key=lambda i: a[i], reverse=True)
for i,l,r,x,j in ilrx:
    l -= 1
    r -= 1
    while idx < n and a[z[idx]]>x:
        seg.update(z[idx],a[z[idx]])
        num.update(z[idx],1)
        idx += 1
    ans[j] = seg.query(l,r)-x*num.query(l,r)

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