#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct SegTree {
	std::vector<std::vector<int> > data; // real data
	int n;
	SegTree (const std::vector<int> &a) {
		for (n = 1; n < (int) a.size(); n *= 2);
		data.resize(2 * n);
		for (int i = 0; i < (int) a.size(); i++) data[i + n] = {a[i]};
		for (int i = n - 1; i; i--) {
			for (auto j : data[i << 1]) if (!data[i].size() || j > data[i].back()) data[i].push_back(j);
			for (auto j : data[i << 1 | 1]) if (!data[i].size() || j > data[i].back()) data[i].push_back(j);
		}
	}
	int query(int l, int r) {
		std::vector<int> left, right;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (r & 1) right.push_back(--r);
			if (l & 1) left.push_back(l++);
		}
		std::vector<int> seg = left;
		std::reverse(right.begin(), right.end());
		for (auto i : right) seg.push_back(i);
		int res = 0;
		int max = 0;
		for (auto i : seg) {
			auto itr = std::lower_bound(data[i].begin(), data[i].end(), max);
			res += data[i].end() - itr;
			max = std::max(max, data[i].back());
		}
		return res;
	}
};

int main() {
	int n = ri();
	int q = ri();
	std::vector<int> a(n);
	for (int i = 0; i < n; i++) a[i] = ri();
	SegTree tree(a);
	for (int i = 0; i < q; i++) {
		ri();
		int l = ri() - 1, r = ri() - 1;
		printf("%d\n", tree.query(l, r + 1));
	}
	return 0;
}