//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

struct info {
	int l, r, id;
	bool operator<(const info I) const {return l < I.l;}
};
const int N = 1e5+10;

//head

int n, q;
int a[N];
info inn[N];
set<P> se;
vi G[N];
int bit[N];
int ans[N];
void add(int i, int x) {
	while(i <= n) {
		bit[i] += x;
		i += i&-i;
	}
}
int sum(int i) {
	int res = 0;
	while(i) {
		res += bit[i];
		i &= i-1;
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> q;
	rep(i, n) cin >> a[i];
	for(int i = n-1; i >= 0; i--) {
		while(!se.empty() and se.begin()->first < a[i]) {
			int now = se.begin()->second;
			se.erase(se.begin());
			G[i+1].emplace_back(now);
		}
		se.emplace(a[i], i);
	}
	for(P x:se) {
		G[0].emplace_back(x.second);
	}
	rep(i, q) {
		int l, r;
		cin >> l >> l >> r;
		l--; r--;
		inn[i] = (info){l, r, i};
	}
	sort(inn, inn+q);
	int j = 0;
	rep(i, n) {
		for(int ne:G[i]) {
			add(ne+1, 1);
		}
		while(j < q and inn[j].l == i) {
			int r = inn[j].r, id = inn[j].id;
			ans[id] = sum(r+1) - sum(i);
			j++;
		}
	}

	rep(i, q) {
		cout << ans[i] << '\n';
	}
}