#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/segtree>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

struct S{
    int cnt;
    ll sum;
    S(int cnt, ll sum): cnt(cnt), sum(sum) {}
};

S op(S x, S y){
    return S(x.cnt+y.cnt, x.sum+y.sum);
}

S e(){
    return S(0, 0);
}

using Seg = atcoder::segtree<S, op, e>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, q; cin >> n >> q;
    vector<ll> a(n);
    map<int, vector<int>> adds;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        adds[a[i]].push_back(i);
    }
    vector<int> l(q), r(q), x(q);
    map<int, vector<int>> queries;
    for(int i = 0; i < q; i++) {
        cin >> l[i] >> r[i] >> x[i]; l[i]--;
        queries[x[i]].push_back(i);
    }
    auto v = a;
    for(int y: x) v.push_back(y);
    sort(v.begin(), v.end());
    v.erase(unique(begin(v), end(v)), end(v));
    Seg seg(n);
    vector<ll> ans(q);
    for(int x: v){
        if(adds.count(x)){
            for(int i: adds[x]){
                seg.set(i, S(1, x));
            }
        }
        if(queries.count(x)){
            for(int i: queries[x]){
                auto s = seg.prod(l[i], r[i]);
                ans[i] = s.sum + (ll)(r[i]-l[i] - s.cnt)*x;
            }
        }
    }
    print_vector(ans, '\n');
}