#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int main() {
  int N, Q;
  cin >> N >> Q;
  vector<long long> A(N+1), P(N+1);
  vector<pair<long long, int>> B(N+2);
  fenwick_tree<long long> bin(N+1), val(N+1);
  for( int i = 1; i <= N; i++ ) {
    cin >> A[i];
    B[i] = make_pair(A[i], i);
  }
  B[N+1] = make_pair(1<<30, 1<<30);
  sort(B.begin(), B.end());
  for( int i = 1; i <= N; i++ ) {
    P[B[i].second] = i;
  }
  vector<int> L(Q+1), R(Q+1);
  vector<long long> X(Q+1);
  vector<vector<long long>> query(N+1, vector<long long>());
  map<pair<int, long long>, long long> res;
  for( int i = 1; i <= Q; i++ ) {
    cin >> L[i] >> R[i] >> X[i];
    query[L[i]-1].emplace_back(X[i]);
    query[R[i]].emplace_back(X[i]);
  }
  for( int i = 1; i <= N; i++ ) {
    bin.add(P[i], 1);
    val.add(P[i], A[i]);
    for( long long& x : query[i] ) {
      pair<long long, int> y = make_pair(x, N+1);
      pair<int, long long> key = make_pair(i, x);
      int k = upper_bound(B.begin(), B.end(), y)-B.begin();
      res[key] = val.sum(0, k)+x*bin.sum(k, N+1);
    }
  }
  for( int i = 1; i <= Q; i++ ) {
    pair<int, long long> keyl = make_pair(L[i]-1, X[i]), keyr = make_pair(R[i], X[i]);
    cout << res[keyr]-res[keyl] << '\n';
  }
}