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

int main(){
	
	int n,q;
	cin>>n>>q;
	
	vector<long long> a(n);
	rep(i,n)cin>>a[i];
	int B = 500;
	vector<vector<long long>> as((n+B-1)/B);
	rep(i,n)as[i/B].push_back(a[i]);
	vector<vector<long long>> sums(as.size());
	rep(i,as.size()){
		sort(as[i].begin(),as[i].end());
		sums[i].resize(as[i].size()+1);
		rep(j,as[i].size())sums[i][j+1]=sums[i][j]+as[i][j];
	}
	
	rep(_,q){
		int L,R;
		long long X;
		cin>>L>>R>>X;
		L--;
		long long ans = 0;
		while(L%B != 0 && L<R){
			ans += abs(a[L] - X);
			L++;
		}
		while(L+B <= R){
			int ii = L / B;
			int d = distance(as[ii].begin(),lower_bound(as[ii].begin(),as[ii].end(),X));
			ans += X * d - sums[ii][d];
			ans += sums[ii].back()-sums[ii][d] - X * (as[ii].size()-d);
			L += B;
		}
		while(L<R){
			ans += abs(a[L] - X);
			L++;
		}
		cout<<ans<<endl;
	}
	return 0;
}