#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#pragma warning (disable: 4996)

int N, Q, A[1 << 17], T[1 << 17], L[1 << 17], R[1 << 17], ans[1 << 17];
vector<pair<int, int>> E[1 << 17];
vector<pair<int, int>> Z;

int main() {
	scanf("%d%d", &N, &Q);
	for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
	for (int i = 1; i <= Q; i++) {
		scanf("%d%d%d", &T[i], &L[i], &R[i]);
		E[L[i]].push_back(make_pair(R[i], i));
	}
	for (int i = N; i >= 1; i--) {
		while (Z.size() >= 1 && Z[Z.size() - 1].second < A[i]) Z.pop_back();
		Z.push_back(make_pair(-i, A[i]));

		for (int j = 0; j < E[i].size(); j++) {
			int pos1 = lower_bound(Z.begin(), Z.end(), make_pair(-E[i][j].first, -1)) - Z.begin();
			ans[E[i][j].second] = Z.size() - pos1;
		}
	}
	for (int i = 1; i <= Q; i++) printf("%d\n", ans[i]);
	return 0;
}