from collections import deque
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
class fenwick_tree():
    n=1
    data=[0 for i in range(n)]
    def __init__(self,N):
        self.n=N
        self.data=[0 for i in range(N)]

    def add(self,p,x):
        assert 0<=p<self.n,"0<=p<n,p={0},n={1}".format(p,self.n)

        p+=1
        while(p<=self.n):
            self.data[p-1]+=x
            p += p&(-p)
    def sum(self,l,r):
        assert (0<=l and l<=r and r<=self.n),"0<=l<=r<=n,l={0},r={1},n={2}".format(l,r,self.n)
        return self.sum0(r)-self.sum0(l)
    def sum0(self,r):
        s=0
        while(r>0):
            s+=self.data[r-1]
            r-=r&-r
        return s

    def __getitem__(self, p):
        if isinstance(p, int):
            return self.sum(p, p + 1)
        else:
            return self.sum(p.start, p.stop)

    def __setitem__(self, p, x):
        return self.add(p, x)

    def __str__(self) -> str:
        return str([self[i] for i in range(self.n)])
    
n, q = mi()

C = fenwick_tree(n)
a = li()
A = [(i, a[i]) for i in range(n)]
A.sort(key = lambda x: x[1], reverse=True)
S = fenwick_tree(n)
query = [[i] + li() for i in range(q)]

query.sort(key = lambda x: x[3])
ans = [0] * q

for i, l, r, x in query:
    while A and A[-1][1] <= x:
        k, a = A.pop()
        C[k] += 1
        S[k] += a
    ans[i] = S[l-1:r] + x * (r - l + 1-  C[l-1:r])


for v in ans:
    print(v)