#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 endl "\n"
#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; }
pair<long long, int> op(pair<long long, int> a, pair<long long, int> b) { return { a.first + b.first,a.second + b.second }; }
pair<long long, int> e() { return { 0,0 }; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<pair<int, pair<int, P>>>v(n + q);
	rep(i, n) {
		int a; cin >> a;
		v[i] = { a,{-1,{i,i}} };
	}
	rep(i, q) {
		int l, r, x; cin >> l >> r >> x;
		l--, r--;
		v[n + i] = { x,{i,{l,r}} };
	}
	sort(all(v));
	segtree<pair<long long, int>, op, e>seg(n);
	vector<long long>ans(q);
	rep(i, n + q) {
		if (-1 == v[i].second.first) {
			seg.set(v[i].second.second.second, { v[i].first,1 });
		}
		else {
			int l = v[i].second.second.first;
			int r = v[i].second.second.second;
			int idx = v[i].second.first;
			auto get = seg.prod(l, r + 1);
			long long val = get.first + (r - l + 1 - get.second)*v[i].first;
			ans[idx] = val;
		}
	}
	rep(i, q)cout << ans[i] << endl;;
	return 0;
}