import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)


class fenwick_tree(object):
    def __init__(self, n):
        self.n = n
        self.log = n.bit_length()
        self.data = [0] * n

    def __sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def add(self, p, x):
        """ a[p] += xを行う"""
        p += 1
        while p <= self.n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        """a[l] + a[l+1] + .. + a[r-1]を返す"""
        return self.__sum(r) - self.__sum(l)

    def lower_bound(self, x):
        """a[0] + a[1] + .. a[i] >= x となる最小のiを返す"""
        if x <= 0:
            return -1
        i = 0
        k = 1 << self.log
        while k:
            if i + k <= self.n and self.data[i + k - 1] < x:
                x -= self.data[i + k - 1]
                i += k
            k >>= 1
        return i


N, Q = map(int, input().split())
A = [(a, i) for i, a in enumerate(map(int, input().split()))]
query = []
for i in range(Q):
    _, l, r, x = map(int, input().split())
    query.append((x, l, r, i))

A.sort()
query.sort()


ans = [-1] * Q
bit_A = fenwick_tree(N)
bit_cnt = fenwick_tree(N)

while A and query:
    if A[-1][0] >= query[-1][0]:
        a, i = A.pop()
        bit_A.add(i, a)
        bit_cnt.add(i, 1)
    else:
        x, l, r, i = query.pop()
        ans[i] = bit_A.sum(l - 1, r) - x * bit_cnt.sum(l - 1, r)

while A:
    a, i = A.pop()
    bit_A.add(i, a)
    bit_cnt.add(i, 1)

while query:
    x, l, r, i = query.pop()
    ans[i] = bit_A.sum(l - 1, r) - x * bit_cnt.sum(l - 1, r)

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