#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
struct Mo{
    int N;
    vector<pair<int,int>>query;
    Mo(int _N):N(_N){}
    void add_query(int l,int r){query.emplace_back(make_pair(l,r));}
    template<typename AL,typename AR,typename EL,typename ER,typename O>
    void mo(const AL&add_left,const AR&add_right,const EL&erase_left,const ER&erase_right,const O&out){
      int Q=query.size();
      if(!Q)return;
      int bs=max(1,N/(int)sqrt(Q));
      vector<int>ord(Q);
      for(int i=0;i<Q;i++)ord[i]=i;
      sort(ord.begin(),ord.end(),[&](int&i,int&j){
        if(query[i].first/bs!=query[j].first/bs)return query[i]<query[j];
        if((query[i].first/bs)%2)return query[i].S<query[j].S;
        return query[i].S>query[j].S;
      });
      int l=0,r=0;
      for(int i=0;i<Q;i++){
        int ql=query[ord[i]].first;
        int qr=query[ord[i]].second;
        while(l>ql)add_left(--l);
        while(r<qr)add_right(r++);
        while(l<ql)erase_left(l++);
        while(r>qr)erase_right(--r);
        out(ord[i]);
      }
    }
};
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  
  ll N,Q;cin>>N>>Q;
  vl A(N);cin>>A;
  auto B=A;
  sort(all(B));
  vl I(N),R(N);
  iota(all(I),0);
  sort(all(I),[&](ll i,ll j){return A[i]<A[j];});
  rep(i,0,N)R[I[i]]=i;
  Mo mo(N);
  vl X(Q);
  rep(i,0,Q){
  	ll L,R;cin>>L>>R>>X[i];
  	mo.add_query(L-1,R);
  }
  fenwick_tree<ll>F(N),G(N);
  vl ans(Q);
  auto add=[&](ll i){
  	F.add(R[i],A[i]);
  	G.add(R[i],1);
  };
  auto erase=[&](ll i){
  	F.add(R[i],-A[i]);
  	G.add(R[i],-1);
  };
  auto out=[&](ll q){
  	ll i=lb(B,X[q]);
  	ans[q]=X[q]*G.sum(0,i)-F.sum(0,i)+F.sum(i,N)-X[q]*G.sum(i,N);
  };
  mo.mo(add,add,erase,erase,out);
  rep(i,0,Q)cout<<ans[i]<<endl;
  return 0;
}