#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct SegTree {
	std::vector<std::vector<std::pair<int, int> > > feed; // feed
	std::vector<std::vector<int> > data; // real data
	int n;
	SegTree (const std::vector<int> &a) {
		for (n = 1; n < (int) a.size(); n *= 2);
		data.resize(2 * n);
		feed.resize(2 * n);
		for (int i = 0; i < (int) a.size(); i++) data[i + n] = {a[i]};
		for (int i = n - 1; i; i--) {
			data[i] = data[i << 1];
			for (auto j : data[i << 1 | 1]) data[i].push_back(j);
			std::sort(data[i].begin(), data[i].end(), std::greater<>());
		}
	}
	void query_reserve(int l, int r, int x) {
		static int n_q = 0;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (r & 1) feed[--r].push_back({x, n_q});
			if (l & 1) feed[l++].push_back({x, n_q});
		}
		n_q++;
	}
	void fetch(std::vector<int64_t> &res) {
		for (int i = 1; i < 2 * n; i++) {
			int head = 0;
			int64_t sum = 0;
			std::sort(feed[i].begin(), feed[i].end(), std::greater<>());
			for (auto &j : feed[i]) {
				int cur = j.first;
				while (head < data[i].size() && data[i][head] >= cur) sum += data[i][head++];
				res[j.second] += sum - head * (int64_t) cur;
			}
		}
	}
};

int main() {
	int n = ri();
	int q = ri();
	std::vector<int> a(n);
	for (int i = 0; i < n; i++) a[i] = ri();
	SegTree tree(a);
	int l[q], r[q], x[q];
	for (int i = 0; i < q; i++) {
		ri();
		l[i] = ri() - 1, r[i] = ri() - 1;
		x[i] = ri();
		tree.query_reserve(l[i], r[i] + 1, x[i]);
	}
	std::vector<int64_t> res(q);
	tree.fetch(res);
	for (int i = 0; i < q; i++) printf("%lld\n", res[i]);
	
	return 0;
}