from operator import itemgetter
import sys
input = sys.stdin.buffer.readline


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

    def build(self, array):
        for i, val in enumerate(array):
            self.bit[i + 1] = val
        for i in range(1, self.size):
            if i + (i & -i) > self.size:
                continue
            self.bit[i + (i & -i)] += self.bit[i]

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

    def add(self, i, val):
        i += 1
        while i <= self.size:
            self.bit[i] += val
            i += i & -i

    def sum(self, l, r):
        return self._sum(r) - self._sum(l)


n, q = map(int, input().split())
a = list(map(int, input().split()))
queries = [[i] + list(map(int, input().split())) for i in range(q)]


queries.sort(key=itemgetter(4), reverse=True)
a = [(i, val) for i, val in enumerate(a)]
a.sort(key=itemgetter(1), reverse=True)

bit_cnt = BinaryIndexedTree(n)
bit_val = BinaryIndexedTree(n)
ans = [0] * q
a_ind = 0
for i, _, l, r, x in queries:
    while a_ind < n and a[a_ind][1] >= x:
        ai, val = a[a_ind]
        bit_cnt.add(ai, 1)
        bit_val.add(ai, val)
        a_ind += 1
    l -= 1
    ans[i] = bit_val.sum(l, r) - bit_cnt.sum(l, r) * x

print("\n".join(map(str, ans)))