from operator import itemgetter 


class SegmentTree():
    """一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
    update: i番目をvalに変更する
    get_sum: 区間[begin, end)の和を求める
    """
    def __init__(self, n):
        self.n = n
        self.size = 1
        while self.size < n:
            self.size *= 2
        self.node = [0] * (2*self.size - 1)

    def update(self, i, val):
        i += (self.size - 1)
        self.node[i] = val
        while i > 0:
            i = (i - 1) // 2
            self.node[i] = self.node[2*i + 1] + self.node[2*i + 2]

    def get_sum(self, begin, end):
        begin += (self.size - 1)
        end += (self.size - 1)
        s = 0
        while begin < end:
            if (end - 1) & 1:
                end -= 1
                s = s + self.node[end]
            if (begin - 1) & 1:
                s = s + self.node[begin]
                begin += 1
            begin = (begin - 1) // 2
            end = (end - 1) // 2
        return s


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

ruiseki = [0]*(n+1)
for i in range(n):
    ruiseki[i+1] = ruiseki[i] + a[i]

st = SegmentTree(n)
st_cnt = SegmentTree(n)

a = sorted(zip(a, range(len(a))))
info = sorted(info, key = itemgetter(4))

minus = 0
ind = 0
ans = []
for i in range(q):
    j, _, l, r, val = info[i]
    if minus < val:
        minus = val
        while True:
            if ind == n:
                break
            if a[ind][0] <= minus:
                st.update(a[ind][1], a[ind][0])
                st_cnt.update(a[ind][1], 1)
                ind += 1
            else:
                break
    ans.append((j, (ruiseki[r] - ruiseki[l-1]) - st.get_sum(l-1, r) - minus * (r-l+1-st_cnt.get_sum(l-1, r))))
ans = sorted(ans)
for i in range(q):
    print(ans[i][1])