#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

struct BIT{
  ll M=1;
  vector<ll> dat;
  BIT(ll N){
    while(N>M) M*=2;
    dat.resize(M*2-1, 0);
  }
  void update(ll x, ll k){
    for(int i=k+1;i<=M;i+=(i&(-i))){
      dat[i] += x;
    }
  }
  ll sum(ll r){
    ll ret = 0;
    for(int k=r;k>0;k-=(k&(-k))) ret += dat[k];
    return ret;
  }

  ll query(ll l, ll r){
    return sum(r) - sum(l);
  }
};

int main(int argc, char const *argv[]) {
  ll n, q;scanf("%lld %lld", &n,&q);
  vll a(n);re(i, n) scanf("%lld", &a[i]);
  vll pre(n, 0);
  BIT bt(n+1);

  for(int i=1;i<n;i++){
    if(a[i]<a[i-1]) pre[i] = i;
    else{
      ll p = pre[i-1];
      while(p!=0&&a[p-1]<a[i]) p--;
      pre[i] = p;
    }
  }
  //for(int i=0;i<n;i++) std::cout << pre[i] << (i==n-1?"\n":" ");

  vvl d = VV(q, 3, 0, ll);
  for(int i=0;i<q;i++){
    ll x, y, z;scanf("%lld %lld %lld",&x,&y,&z);
    d[i] = {y, z, i};
  }
  sort(all(d), [](vll x, vll y){return x[1]<y[1];});//r
  vll ans(q, 0);

  ll idx = 0;

  for(int r=1;r<=n;r++){
    //更新
    bt.update(-1, pre[r-1]);
    bt.update(1, r);
    while(idx!=q&&d[idx][1]==r){
      ll num = bt.query(d[idx][0], r+1);
      //std::cout << num << " " << d[idx][2] << '\n';
      ans[d[idx][2]] = num;
      idx++;
    }
    //for(int j=0;j<=n;j++) std::cout << bt.query(j, j+1) << (j==n?"\n":" ");
  }
  re(i, q) printf("%lld\n", ans[i]);
  return 0;
}