#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

#include<atcoder/fenwicktree>

void Solve(){
    int N,Q;
    cin>>N>>Q;
    vector<ll>A(N);
    for(int i=0;i<N;i++)cin>>A[i];
    vector<tuple<ll,int,int,int>>V;
    for(int i=0;i<Q;i++){
        int l,r;
        ll x;
        cin>>l>>r>>x;
        l--;
        r--;
        V.push_back(make_tuple(x,l,r,i));
    }
    for(int i=0;i<N;i++)V.push_back(make_tuple(A[i],-1,-1,i));
    sort(all(V));
    vector<ll>S(N+1);
    for(int i=0;i<N;i++)S[i+1]=S[i]+A[i];
    atcoder::fenwick_tree<ll>fw1(N),fw2(N);
    vector<ll>ans(Q);
    for(auto[x,l,r,q]:V){
        if(l==-1){
            fw1.add(q,x);
            fw2.add(q,1);
        }else{
            ll sum=S[r+1]-S[l];
            ll a=fw1.sum(l,r+1),b=sum-a,c=fw2.sum(l,r+1),d=r+1-l-c;
            ans[q]=b-d*x+c*x-a;
        }
    }
    for(int i=0;i<Q;i++)cout<<ans[i]<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    Solve();
}