#include <bits/stdc++.h>
using namespace std;
#include <atcoder/fenwicktree>

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long

struct Mo {
    int width;
    vector<int> left, right, order;

    Mo(int N, int Q) : order(Q) {
        width = max<int>(1, 1.0 * N / max<double>(1.0, sqrt(Q * 2.0 / 3.0)));
        iota(begin(order), end(order), 0);
    }

    void insert(int l, int r) { /* [l, r) */
        left.emplace_back(l);
        right.emplace_back(r);
    }

    template <typename AL, typename AR, typename DL, typename DR, typename REM>
    void run(const AL &add_left, const AR &add_right, const DL &delete_left,
             const DR &delete_right, const REM &rem) {
        assert(left.size() == order.size());
        sort(begin(order), end(order), [&](int a, int b) {
            int ablock = left[a] / width, bblock = left[b] / width;
            if (ablock != bblock) return ablock < bblock;
            if (ablock & 1) return right[a] < right[b];
            return right[a] > right[b];
        });
        int nl = 0, nr = 0;
        for (auto idx : order) {
            while (nl > left[idx]) add_left(--nl);
            while (nr < right[idx]) add_right(nr++);
            while (nl < left[idx]) delete_left(nl++);
            while (nr > right[idx]) delete_right(--nr);
            rem(idx);
        }
    }
};

/**
 * @brief Mo's algorithm
 * @docs docs/misc/mo.md
 */

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    int N, Q; cin >> N >> Q;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];

    Mo mo(N, Q);
    vector<int> L(Q), R(Q);
    vector<ll> X(Q);
    rep(i, 0, Q) {
        cin >> L[i] >> R[i];
        cin >> X[i];
        L[i]--;
        mo.insert(L[i], R[i]);
    }

    vector<ll> C = A; C.insert(C.end(), X.begin(), X.end());
    sort(C.begin(), C.end());
    vector<int> B(N);
    rep(i, 0, N) B[i] = lower_bound(C.begin(), C.end(), A[i]) - C.begin();
    vector<int> Y(Q);
    rep(i, 0, Q) Y[i] = lower_bound(C.begin(), C.end(), X[i]) - C.begin();
    // for (int v : B) cout << v << " ";
    // cout << endl;
    // for (int v : Y) cout << v << " ";
    // cout << endl;

    atcoder::fenwick_tree<ll> F(N+Q);
    atcoder::fenwick_tree<int> G(N+Q);

    auto add = [&](int x) -> void {
        F.add(B[x], A[x]);
        G.add(B[x], 1);
    };
    auto del = [&](int x) -> void {
        F.add(B[x], -A[x]);
        G.add(B[x], -1);
    };
    
    vector<ll> ANS(Q);
    auto rem = [&](int id) -> void {
        ll ans = 0;
        {
            ans += F.sum(Y[id], N+Q);
            ans -= G.sum(Y[id], N+Q) * X[id];
        }
        {
            ans += G.sum(0, Y[id]) * X[id];
            ans -= F.sum(0, Y[id]);
        }
        ANS[id] = ans;
    };
    mo.run(add, add, del, del, rem);
    rep(i, 0, Q) cout << ANS[i] << endl;
}