#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

template<class T>
struct BIT {
  vector<T> dat;

  BIT(int n) : dat(n + 1) {}

  void update(int k, T v) {
    for (int i = k + 1; i < dat.size(); i += i & -i) {
      dat[i] += v;
    }
  }

  T query(int k) {
    T res = 0;
    for (int i = k; i > 0; i -= i & -i) {
      res += dat[i];
    }
    return res;
  }
};


int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int N, Q; cin >> N >> Q;
  vector<int> A(N);
  vector<int> pred(N, -1);
  vector<int> stk;
  vector<vector<int>> events(N + 1);
  rep(i, N) {
    cin >> A[i];
    while (!stk.empty() && A[stk.back()] <= A[i]) {
      stk.pop_back();
    }
    if (!stk.empty()) pred[i] = stk.back();
    events[pred[i] + 1].push_back(i);
    stk.push_back(i);
  }
  vector<int> L(Q), R(Q);
  vector<vector<int>> queries(N);
  rep(i, Q) {
    int tmp; cin >> tmp;
    cin >> L[i] >> R[i]; L[i]--;
    queries[L[i]].push_back(i);
  }
  vector<int> ans(Q);
  BIT<int> bit(N);
  rep(i, N) {
    for (int j : events[i]) bit.update(j, 1);
    for (int j : queries[i]) {
      ans[j] = bit.query(R[j]) - bit.query(L[j]);
    }
  }
  rep(i, Q) cout << ans[i] << '\n';
}