#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<ll> L(Q);
    vector<ll> R(Q);
    vector<ll> X(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> L[i] >> R[i] >> X[i];
        L[i]--;
        R[i]--;
    }
    // クエリに対するイベントソート
    vector<pll> qs(0);
    for (ll i = 0; i < N; i++) {
        qs.push_back(make_pair(A[i], i));
    }
    for (ll i = 0; i < Q; i++) {
        qs.push_back(make_pair(X[i], i + N));
    }

    sort(all(qs));

    fenwick_tree<ll> bit1(N);
    fenwick_tree<ll> bit2(N);
    fenwick_tree<ll> bit3(N);
    for (ll i = 0; i < N; i++) {
        bit3.add(i, A[i]);
    }

    vector<ll> ans(Q);
    for (ll i = 0; i < N + Q; i++) {
        pll query = qs[i];
        ll num = query.first;
        ll type = query.second;
        if (type < N) {
            bit1.add(type, 1);
            bit2.add(type, num);
        } else {
            ll idx = type - N;
            ll sum1 = bit1.sum(L[idx], R[idx] + 1);
            ll sum2 = bit2.sum(L[idx], R[idx] + 1);
            ll sum3 = bit3.sum(L[idx], R[idx] + 1);
            // debug_out(idx, sum1, sum2, sum3);
            ll ans_val = ((sum3 - sum2) - (R[idx] - L[idx] + 1 - sum1) * num) +
                         (num * sum1 - sum2);
            ans[idx] = ans_val;
        }
    }
    for (ll i = 0; i < Q; i++) {
        cout << ans[i] << endl;
    }
}