#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long qinf = -1;
int n, n1;
vector<long long> segtree;
void segset() {
	for (int i = 0; i < 500050; i++) {
		segtree.emplace_back(qinf);
	}
	n1 = n;
	int t = 1;
	while (t < n) {
		t *= 2;
	}
	n = t;
}
void add(int i, long long x) {
	int now = n + i - 1;
	segtree[now] = x;
	while (now > 0) {
		now = now / 2;
		segtree[now] = max(segtree[now * 2], segtree[now * 2 + 1]);
	}
}
long long qans1(int l, int r, int i, int nl, int nr) {
	cout << i << " " << nl << " " << nr << endl;
	if (nl > r || l > nr) {
		return qinf;
	}
	else if (nl >= l && nr <= r) {
		return segtree[i];
	}
	else {
		long long x = qans1(l, r, i * 2, nl, (nl + nr) / 2);
		long long y = qans1(l, r, i * 2 + 1, (nl + nr) / 2 + 1, nr);
		return max(x, y);
	}
}
long long q_ans(int l, int r) {
	return qans1(l, r, 1, 1, n);
}
int lower_seg1(int l, int r, long long x, int i, int nl, int nr) {
	if (segtree[i] < x || nl > r || l > nr) {
		return r + 1;
	}
	else if (i >= n) {
		return i - n + 1;
	}
	else {
		int cl = lower_seg1(l, r, x, i * 2, nl, (nl + nr) / 2);
		if (cl != r + 1) {
			return cl;
		}
		else {
			return lower_seg1(l, r, x, i * 2 + 1, (nl + nr) / 2 + 1, nr);
		}
	}
}
int lower_seg(int l, int r, long long x) {
	return lower_seg1(l, r, x, 1, 1, n);
}
long long a[100010];
int in[100010];
vector<vector<int>> vec(100010);
int main() {
	int q;
	cin >> n >> q;
	segset();
	for (int i = 1; i <= n1; i++) {
		in[i] = -1;
		cin >> a[i];
		add(i, a[i]);
	}
	int now = -1;
	for (int i = 1; i <= n1; i++) {
		if (in[i] == -1) {
			now++;
			in[i] = now;
		}
		int t = lower_seg(i + 1, n1, a[i]);
		if (t != n1 + 1) {
			in[t] = in[i];
		}
		vec[in[i]].emplace_back(i);
	}
	for (int i = 0; i <= now; i++) {
		vec[i].emplace_back(n1 + 1);
	}
	for (int i = 0; i < q; i++) {
		int query, l, r;
		cin >> query >> l >> r;
		auto itr = lower_bound(vec[in[l]].begin(), vec[in[l]].end(), l);
		auto itr1 = upper_bound(vec[in[l]].begin(), vec[in[l]].end(), r);
		cout << int(itr1 - itr) << endl;
	}
}