// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}

template <typename T, T (*OP)(T, T), T (*E)()>
struct SegmentTree { 
  vector<T> seg;
  ll seg_size;//葉の数
    
  SegmentTree(ll N) : seg(4*N, E()), seg_size() {
    seg_size = 1;
    while(seg_size < N) seg_size *= 2;
  }
  SegmentTree(const vector<T> a) : seg(4*a.size(), E()), seg_size() {
    ll N = a.size();
    seg_size = 1;
    while(seg_size < N) seg_size *= 2;
    rep(i,N) seg[i + seg_size - 1] = a[i];
    for(ll i = seg_size-2; i >= 0; i --){
      seg[i] = OP(seg[2*i + 1], seg[2*i + 2]);
    }
  }
  
  void set(ll idx, T x){
    idx += seg_size - 1;
    seg[idx] = x;
    
    while(idx > 0){
      idx = (idx - 1) / 2;
      seg[idx] = OP(seg[2*idx + 1], seg[2*idx + 2]);
    }
  }

  void apply(ll idx, T x){
    idx += seg_size - 1;
    seg[idx] = OP(seg[idx], x);
    
    while(idx > 0){
      idx = (idx - 1) / 2;
      seg[idx] = OP(seg[2*idx + 1], seg[2*idx + 2]);
    }
  }
 

  T prod(ll a, ll b) { return prod_sub(a, b, 0, 0, seg_size); }
  T prod_sub(ll a, ll b, ll idx, ll left, ll right){
    if(a >= right || b <= left) return E();
    if(a <= left && b >= right) return seg[idx];
  
    T v1 = prod_sub(a, b, 2 * idx + 1, left, (left + right) / 2);
    T v2 = prod_sub(a, b, 2 * idx + 2, (left + right) / 2, right);
    return OP(v1, v2);
  }
  
};


template<typename S>
S e(){return 0;}
template<typename S>
S op(S L, S R){return L+R;}






void solve(){
    ll n,q;
    cin >> n >> q;
    V<ll> a(n);
    rep(i,n) cin >> a[i];
    V<ll> ans(q, 0);
    V<tuple<ll,ll,ll>> ev;
    rep(i, n) ev.eb(a[i], i, 0);
    V<ll> L,R,X;
    rep(i, q){
        ll l,r,x;
        cin >> l >> r >> x;
        l--;
        L.eb(l);
        R.eb(r);
        X.eb(x);
        ev.eb(x, i, 1);
    }
    sort(be(ev));
    SegmentTree<ll, op, e> seg(n), seg2(a);
    SegmentTree<ll, op, e> cnt(n), cnt2(n);
    rep(i, n) cnt2.set(i, 1);
    
    for(auto[x, i, t]: ev){
        if(t==0){
            seg.set(i, x);
            seg2.set(i, 0);
            cnt.set(i, 1);
            cnt2.set(i, 0);
        }else{
            {
                ll p = seg.prod(L[i], R[i]);
                ll c = cnt.prod(L[i], R[i]);
                ans[i] += c*x - p;
            }
            {
                ll p = seg2.prod(L[i], R[i]);
                ll c = cnt2.prod(L[i], R[i]);
                ans[i] += p - c*x;
            }
        }
    }
    for(auto x:ans) cout << x << endl;
    
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}