import sys

input = sys.stdin.buffer.readline


class Bit:
    """1-indexed"""

    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def _sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def sum(self, i, j):
        """閉区間[i, j]"""
        return self._sum(j) - self._sum(i - 1)

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i


N, Q = map(int, input().split())
A = tuple(map(int, input().split()))
SA = [(a, i) for i, a in enumerate(A, 1)]
SA.sort()
queries = []
for i in range(Q):
    _, l, r, x = map(int, input().split())
    queries.append((i, l, r, x))
queries.sort(key=lambda t: -t[3])

bit_alive = Bit(N)
bit_sum = Bit(N)
ans = [0] * Q
for i, l, r, x in queries:
    while SA and SA[-1][0] >= x:
        a, ia = SA.pop()
        bit_alive.add(ia, 1)
        bit_sum.add(ia, a)
    ans[i] = bit_sum.sum(l, r) - bit_alive.sum(l, r) * x
print(*ans, sep='\n')