class SegTree:
    """ define what you want to do with 0 index, ex) size = tree_size, func = min or max, sta = default_value """
    
    def __init__(self,size,func,sta):
        self.n = size
        self.size = 1 << size.bit_length()
        self.func = func
        self.sta = sta
        self.tree = [sta]*(2*self.size)

    def build(self, list):
        """ set list and update tree"""
        for i,x in enumerate(list,self.size):
            self.tree[i] = x

        for i in range(self.size-1,0,-1):
            self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1])

    def set(self,i,x):
        i += self.size
        self.tree[i] = x
        while i > 1:
            i >>= 1
            self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1])

    
    def get(self,l,r):
        """ take the value of [l r) with func (min or max)"""
        l += self.size
        r += self.size
        res = self.sta

        while l < r:
            if l & 1:
                res = self.func(self.tree[l],res)
                l += 1
            if r & 1:
                res = self.func(self.tree[r-1],res)
            l >>= 1
            r >>= 1
        return res


n,q = map(int,input().split())
A = list(map(int,input().split()))
Q = [list(map(int,input().split())) for i in range(q)]
sA = [[a,i] for i,a in enumerate(A)]
sQ = [[Q[i][3],i] for i in range(q)]
sA.sort(reverse=True)
sQ.sort(reverse=True)
def func(x,y):
    return x+y
seg1 = SegTree(n,func,0)
seg2 = SegTree(n,func,0)
now = 0
ans = [0]*q
for x,ind in sQ:
    while now < n and sA[now][0] >= x:
        a,i = sA[now]
        seg1.set(i,a)
        seg2.set(i,1)
        now += 1
    _,l,r,_ = Q[ind]

    count = seg1.get(l-1,r)-x*seg2.get(l-1,r)
    ans[ind] = count
    
for i in ans:
    print(i)