#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from operator import itemgetter

N, Q = map(int, readline().split())
A = (0,) + tuple(map(int, readline().split()))


class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

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

    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1


tasks = []
for i, query in enumerate(readlines()):
    _, L, R, X = map(int, query.split())
    tasks.append((i, R, X, ))
    tasks.append((i, 1 - L, X))
tasks.sort(key=itemgetter(2), reverse=True)

nums = sorted(enumerate(A), key=itemgetter(1))

bit0 = BinaryIndexedTree([0] * (N + 10))
bit1 = BinaryIndexedTree([0] * (N + 10))

answers = [0] * Q
for i, n, x in tasks:
    while nums[-1][1] > x:
        j, a = nums.pop()
        bit0.add(j, a)
        bit1.add(j, -1)
    m = abs(n)
    a = bit1.get_sum(m)
    b = bit0.get_sum(m)
    S = a * x + b
    if n > 0:
        answers[i] += S
    else:
        answers[i] -= S

print('\n'.join(map(str, answers)))