#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

struct S {
  ll sm = 0;
  int cnt = 0;
};

S op(S x, S y) {
  return {x.sm + y.sm, x.cnt + y.cnt};
}

S e() { return {}; }


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  VI a(n);
  rep(i, n) cin >> a[i];
  vector<int> ord(n);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](int i, int j) {
    return a[i] > a[j];
  });
  struct Q { int i, l, r, x; };
  vector<Q> qs(q);
  rep(iq, q) {
    auto& [i, l, r, x] = qs[iq];
    i = iq;
    cin >> l >> r >> x;
    l--;
  }
  segtree<S, op, e> seg(vector<S>(n, {0, 1}));
  sort(all(qs), [](const Q& x, const Q& y) {
    return x.x < y.x;
  });
  VL ans(q);
  for(auto [i, l, r, x]: qs) {
    while(!ord.empty() && a[ord.back()] < x) {
      seg.set(ord.back(), {a[ord.back()], 0});
      ord.pop_back();
    }
    auto [s, c] = seg.prod(l, r);
    ans[i] = s + (ll)x * c;
  }
  rep(i, q) cout << ans[i] << '\n';
}