#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100100;
// fat node fenwick tree
struct PersistentFenwick {
    vector<pair<int, ll>> fw[N]; // value, version
    int n;
    void init(int _n) {
        n = _n;
        for (int i = 1;i <= n;i++) fw[i].push_back({ 0, 0ll });
    }
    void update(int v, ll w, int ver) {
        for (int i = v;i <= n;i += i & -i) {
            fw[i].push_back({ ver, fw[i].back().second + w });
        }
    }
    ll query(int ver, int v) {
        ll ans = 0;
        for (int i = v;i > 0;i -= i & -i) {
            ans += (--upper_bound(fw[i].begin(), fw[i].end()
                , pair<int, ll>(ver, LLONG_MAX)))->second;
        }
        return ans;
    }
} fw, cnt;
ll a[N], qs[N];
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    vector<ll> c;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        qs[i] = qs[i - 1] + a[i];
        c.push_back(a[i]);
    }
    sort(c.begin(), c.end());
    c.resize(unique(c.begin(), c.end()) - c.begin());
    int m = c.size();
    fw.init(m), cnt.init(m);
    for (int i = 1;i <= n;i++) {
        int idx = upper_bound(c.begin(), c.end(), a[i]) - c.begin();
        fw.update(idx, a[i], i);
        cnt.update(idx, 1, i);
    }
    while (q--) {
        int l, r;
        ll x;
        cin >> l >> r >> x;
        int idx = lower_bound(c.begin(), c.end(), x) - c.begin() + 1;
        ll suml = fw.query(r, idx - 1) - fw.query(l - 1, idx - 1);
        ll cntl = cnt.query(r, idx - 1) - cnt.query(l - 1, idx - 1);
        ll sumr = (qs[r] - qs[l - 1]) - suml;
        ll cntr = (r - l + 1) - cntl;
        cout << (x * cntl - suml) + (sumr - x * cntr) << '\n';
    }
    return 0;
}