/*************************************
* author: marvinthang *
* created: 12.12.2023 15:28:33 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// index from 0
template <class T> struct Fenwick {
int n; vector <T> bit;
Fenwick(int _n = 0): n(_n), bit(n + 1, 0) {}
void reset(void) { fill(bit.begin(), bit.end(), 0); }
void resize(int _n) { bit.assign(_n + 1, 0); }
void update(int i, T val) { for (++i; i <= n; i += i & -i) bit[i] += val; }
T get(int i) {
if (i < 0) return 0;
T res(0);
for (i = min(i + 1, n); i > 0; i &= i - 1) res += bit[i];
return res;
}
int upper_bound(T val) {
int res = 0;
for (int i = __lg(n); i >= 0; --i)
if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
return res;
}
int lower_bound(T val) {
int res = 0;
for (int i = __lg(n); i >= 0; --i)
if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
return res;
}
};
// end of template
void process(void) {
int n, q; cin >> n >> q;
vector <int> s(n); cin >> s;
vector <vector <pair <int, int>>> queriesAt(n);
REP(i, q) {
int t, l, r; cin >> t >> l >> r; --l; --r;
queriesAt[r].emplace_back(i + 1, t);
if (l) queriesAt[l - 1].emplace_back(-1 - i, t);
}
vector <int> st;
Fenwick <long long> sum_idx(n + 1), sum_const(n + 1);
auto update = [&] (int i, int v) {
// sum[x] += (x - i + 1) * v;
sum_const.update(i, 1LL * (i - 1) * v);
sum_idx.update(i, v);
};
auto get = [&] (int i) {
return sum_idx.get(i) * i - sum_const.get(i);
};
vector <long long> sum_st;
vector <long long> res(q);
REP(i, n) {
while (!st.empty() && s[st.back()] <= s[i]) {
int j = st.back(); st.pop_back(); sum_st.pop_back();
update(i - j, -s[j]);
if (!st.empty()) update(i - st.back(), s[j]);
}
update(0, s[i]);
if (!st.empty()) {
update(i - st.back(), -s[i]);
sum_st.push_back(1LL * (i - st.back()) * s[i] + sum_st.back());
} else sum_st.push_back(0);
st.push_back(i);
for (auto [x, t]: queriesAt[i]) {
long long cur = get(t);
// i - f <= t => f >= i - t
int p = lower_bound(ALL(st), i - t) - st.begin();
cur -= sum_st.back() - sum_st[p] + 1LL * (t + st[p] - i) * s[st[p]];
if (x > 0) res[x - 1] += cur;
else res[-1 - x] -= cur;
}
}
REP(i, q) cout << res[i] << '\n';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("JOI20_ho_t5");
// int t; cin >> t; while (t--)
process();
// cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
