#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int sz;
vector<int> seg[1<<18];
vector<int> mx[1<<18];
vector<int> sum[1<<18];
int a[1<<17];
void find(int a, int b, int k, int l, int r, vector<P>& v){
	if(r<=a || b<=l) return;
	if(a<=l && r<=b){
		v.push_back({k, l});
	}else{
		find(a, b, 2*k+1, l, (l+r)/2, v);
		find(a, b, 2*k+2, (l+r)/2, r, v);
	}
}
int query(vector<P> v){
	int ret=0;
	int mx0=0;
	for(auto p:v){
		int k=p.first;
		if(seg[k].empty()) continue;
		int t=lower_bound(mx[k].begin(), mx[k].end(), mx0)-mx[k].begin();
		ret+=sum[k].back()-sum[k][t-1];
		mx0=max(mx0, mx[k].back());
	}
	return ret;
}
int main()
{
	int n, q; cin>>n>>q;
	for(int i=0; i<n; i++) cin>>a[i];
	sz=1;
	while(sz<n) sz<<=1;
	for(int i=0; i<n; i++){
		seg[i+sz-1].push_back(a[i]);
		sum[i+sz-1].push_back(0);
		sum[i+sz-1].push_back(1);
		mx[i+sz-1].push_back(-1);
      mx[i+sz-1].push_back(a[i]);
	}
	for(int i=sz-2; i>=0; i--){
		for(auto x:seg[2*i+1]) seg[i].push_back(x);
		for(auto x:seg[2*i+2]) seg[i].push_back(x);
		sum[i].resize(seg[i].size()+1);
		mx[i].resize(seg[i].size()+1);
		mx[i][0]=-1;
		for(int j=0; j<seg[i].size(); j++){
			sum[i][j+1]=sum[i][j];
			mx[i][j+1]=mx[i][j];
			if(mx[i][j]<seg[i][j]){
				mx[i][j+1]=seg[i][j];
				sum[i][j+1]++;
			}
		}
	}
	for(int i=0; i<q; i++){
		int t, l, r; cin>>t>>l>>r;
		vector<P> v;
		find(l-1, r, 0, 0, sz, v);
		cout<<query(v)<<endl;
	}
	return 0;
}