#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/segtree>

struct F{
    ll val = 0;
    ll c = 0;
};

F op(F l, F r){
    return {l.val + r.val, l.c + r.c};
}

F e(){
    return F{};
}

vector<int> make_order(vector<ll> v){
    vector<int> order;
    rep(i, 0, v.size()) order.push_back(i);
    sort(all(order), [&](int l, int r){
        return v[l] < v[r];
    });
    return order;
}

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    vector<ll> L(Q), R(Q), X(Q);
    rep(i, 0, Q) cin >> L[i] >> R[i] >> X[i], L[i]--;
    atcoder::segtree<F, op, e> seg1(N), seg2(N);
    rep(i, 0, N) seg1.set(i, {A[i], 1});
    auto A_order = make_order(A);
    auto X_order = make_order(X);
    A_order.push_back(N);
    vector<ll> ans(Q);
    int a_ind = A_order[0], aa = 0;
    for (auto id : X_order){
        while (a_ind != N && X[id] > A[a_ind]){
            seg1.set(a_ind, e());
            seg2.set(a_ind, {A[a_ind], 1});
            aa++;
            a_ind = A_order[aa];
        }
        auto tmp1 = seg1.prod(L[id], R[id]);
        auto tmp2 = seg2.prod(L[id], R[id]);
        // cout << tmp1.val << " " << tmp1.c << "\n";
        ans[id] += tmp1.val - tmp2.val;
        ans[id] += X[id] * (tmp2.c - tmp1.c);
    }
    for (auto x : ans) cout << x << "\n";
}