import sys
input = sys.stdin.readline

class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n
 
    def add(self, p, x):
        assert 0 <= 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 <= r <= self._n
        return self._sum(r) - self._sum(l)
 
    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s
    
    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x
    

N, Q = map(int, input().split())
A = list(map(int, input().split()))
D = []
for i in range(N):
    D.append((A[i], i))

query = []
for i in range(Q):
    _, l, r, x = list(map(int, input().split()))
    l -= 1
    query.append((x, l, r, i))

D.sort()
query.sort(reverse=True)
val = Fenwick_Tree(N)
num = Fenwick_Tree(N)
ans = [0] * Q
for x, l, r, i in query:
    while D:
        if D[-1][0] >= x:
            a, ind = D.pop()
            num.add(ind, 1)
            val.add(ind, a)
        else:
            break
    ans[i] = val.sum(l, r) - x * num.sum(l, r)

for a in ans:
    print(a)