#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

int main(){
	
	int N,Q;
	cin>>N>>Q;
	vector<int> a(N);
	rep(i,N)scanf("%d",&a[i]);
	vector<int> t = a;
	
	vector<int> l(Q),r(Q),x(Q);
	rep(i,Q){
		scanf("%d %d %d",&l[i],&r[i],&x[i]);
		r[i]--,l[i]--;
		t.push_back(x[i]);
	}
	
	sort(t.begin(),t.end());
	t.erase(unique(t.begin(),t.end()),t.end());
	
	fenwick_tree<long long> Fs(t.size()),Fc(t.size());
	
	vector<long long> ans(Q,0);
	vector<vector<pair<int,int>>> qs(N);
	rep(i,Q){
		if(l[i]!=0){
			qs[l[i]-1].emplace_back(i,-1);
		}
		qs[r[i]].emplace_back(i,1);
	}
	
	rep(i,N){
		int d = distance(t.begin(),lower_bound(t.begin(),t.end(),a[i]));
		Fc.add(d,1);
		Fs.add(d,a[i]);
		
		rep(j,qs[i].size()){
			int ii = qs[i][j].first;
			int p = distance(t.begin(),lower_bound(t.begin(),t.end(),x[ii]));
			long long S = 0;
			S += Fs.sum(0,p);
			S += Fc.sum(p,t.size())*x[ii];
			ans[ii] += S * qs[i][j].second;
		}
	}
	
	rep(i,Q){
		printf("%lld\n",ans[i]);
	}
		
		
	
	
    return 0;
}