/*input
20 20
2 1 2 2 1 1 1 1 2 2 2 1 2 1 1 2 1 2 1 1
1 1 14
2 3 18
4 10 15
8 2 17
9 20 20
4 8 19
7 2 20
11 1 5
13 2 8
20 1 20
2 12 15
7 1 14
12 7 18
14 2 17
9 19 20
12 12 12
6 2 15
11 2 15
19 12 17
4 1 20
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
return a*b%MOD;
}
ll mypow(ll a,ll b){
if(b<=0) return 1;
ll res=1LL;
while(b){
if(b&1) res=(res*a)%MOD;
a=(a*a)%MOD;
b>>=1;
}
return res;
}
const ll maxn=4e5+5;
const ll maxlg=__lg(maxn)+2;
/** Interface */
inline int readChar();
template <class T = ll> inline T readInt();
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x );
inline void writeWord( const char *s );
/** Read */
static const int buf_size = 4096;
inline int getChar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len)
pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len)
return -1;
return buf[pos++];
}
inline int readChar() {
int c = getChar();
while (c <= 32)
c = getChar();
return c;
}
template <class T>
inline T readInt() {
int s = 1, c = readChar();
T x = 0;
if (c == '-')
s = -1, c = getChar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = getChar();
return s == 1 ? x : -x;
}
/** Write */
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar( int x ) {
if (write_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
template <class T>
inline void writeInt(T x, char end ) {
if (x < 0)
writeChar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n)
s[n++] = '0' + x % 10, x /= 10;
while (n--)
writeChar(s[n]);
if (end)
writeChar(end);
}
inline void writeWord( const char *s ) {
while (*s)
writeChar(*s++);
}
struct Flusher {
~Flusher() {
if (write_pos)
fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
} flusher;
struct segt{
ll seg[4*maxn],lazy[4*maxn];
int n;
void resize(int _n){
n=_n;
}
inline void pushdown(int idx,int l,int r){
if(!lazy[idx]) return;
if(l==r){
lazy[idx]=0;
return;
}
int mid=(l+r)/2;
seg[idx<<1]+=lazy[idx]*(mid-l+1);
seg[idx<<1|1]+=lazy[idx]*(r-mid);
lazy[idx<<1]+=lazy[idx];
lazy[idx<<1|1]+=lazy[idx];
lazy[idx]=0;
}
inline void upd(int idx,int l,int r,int ql,int qr,ll x){
if(ql<=l and r<=qr){
lazy[idx]+=x;
seg[idx]+=x*(r-l+1);
return;
}
pushdown(idx,l,r);
int mid=l+r>>1;
if(qr<=mid) upd(idx<<1,l,mid,ql,qr,x);
else if(ql>mid) upd(idx<<1|1,mid+1,r,ql,qr,x);
else upd(idx<<1,l,mid,ql,qr,x),upd(idx<<1|1,mid+1,r,ql,qr,x);
seg[idx]=(seg[idx<<1]+seg[idx<<1|1]);
}
inline ll query(int idx,int l,int r,int ql,int qr){
pushdown(idx,l,r);
if(ql<=l and r<=qr) return seg[idx];
int mid=l+r>>1;
if(qr<=mid) return query(idx<<1,l,mid,ql,qr);
else if(ql>mid) return query(idx<<1|1,mid+1,r,ql,qr);
return query(idx<<1,l,mid,ql,qr)+query(idx<<1|1,mid+1,r,ql,qr);
}
inline ll query(int l,int r){
if(l>r) return 0;
return query(1,0,n-1,l,r);
}
inline void upd(int l,int r,ll x){
if(l>r) return;
upd(1,0,n-1,l,r,x);
}
}rect,par;
int n,q;
int arr[maxn];
ll ans[maxn];
vector<pair<pii,int>> upd[maxn];
vector<pair<pii,int>> query[maxn];
inline void tri(int l,int r,int v){
if(l>r) return;
//parallelogram-rectangle
par.upd(l+n,2*n+1,v);
rect.upd(r+n+1,2*n+1,-v);
//place where xiao and da intersect
if((r-l+1)<=n) upd[r-l+1].pb({{l,r},v});
}
int l[maxn],r[maxn];
int main(){
ios::sync_with_stdio(false),cin.tie(0);
rect.resize(maxn),par.resize(maxn);
n=readInt(),q=readInt();
REP(i,n) arr[i]=readInt();
vector<int> v;
REP(i,n){
while(sz(v) and arr[v.back()]<arr[i]) v.pop_back();
if(sz(v)) l[i]=v.back();
else l[i]=-n-1;
v.pb(i);
}
v.clear();
for(int i=n-1;i>=0;i--){
while(sz(v) and arr[v.back()]<=arr[i]) v.pop_back();
if(sz(v)) r[i]=v.back();
else r[i]=n+1;
v.pb(i);
}
REP(i,n){
tri(l[i]+1,r[i]-1,arr[i]);
tri(l[i]+1,i-1,-arr[i]);
tri(i+1,r[i]-1,-arr[i]);
}
REP(i,q){
int t=readInt(),l=readInt(),r=readInt();
--l,--r;
query[t].pb({{l,r},i});
}
REP1(i,n){
for(auto x:upd[i]){
int l=x.f.f,r=x.f.s,v=x.s;
par.upd(l+n,2*n+1,-v);
rect.upd(r+n+1,2*n+1,v);
}
for(auto x:query[i]){
int l=x.f.f,r=x.f.s;
ans[x.s]=par.query(l-i+n,r-i+n)+rect.query(l+n,r+n);
}
}
REP(i,q) writeInt(ans[i],'\n');
}
