#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long op(long long a, long long b) { return a + b; }
long long e() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<long long>a(n);
	rep(i, n)cin >> a[i];
	map<long long, vector<pair<int, int>>>eve;
	rep(i, n) {
		eve[a[i]].push_back({ 1,i });
	}
	vector<tuple<int, int, long long>>query;
	rep(i, q) {
		int l, r; cin >> l >> r;
		l--;
		long long x; cin >> x;
		query.emplace_back(l, r, x);
		eve[x].emplace_back(2, i);
	}
	segtree<long long, op, e>segS(n);
	segtree<long long, op, e>segC(n);
	rep(i, n)segS.set(i, a[i]);
	rep(i, n)segC.set(i, 1);
	vector<long long>ans(q);
	for (auto[k, v] : eve) {
		for (auto[t, i] : v) {
			if (t == 1) {
				segS.set(i, -a[i]);
				segC.set(i, -1);
			}
			else {
				auto[l, r, x] = query[i];
				long long val = 0;
				val += segS.prod(l, r);
				val -= segC.prod(l, r) * x;
				ans[i] = val;
			}
		}
	}
	for (auto e : ans)cout << e << endl;
	return 0;
}