#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif
struct segtree{
	using D = long long;

	int N;
	vector<D> val;

	segtree(){}
	segtree(int n){
		N=1;
		while(N<n) N*=2;
		val.assign(N*2,0);
	}
	segtree(const vector<D>& ds){
		int n = ds.size();
		N=1;
		while(N<n) N*=2;
		val.assign(N*2,0);
		rep(i,n) val[i+N] = ds[i];
		for(int i=N-1;i>0;i--) val[i] = val[i*2] + val[i*2+1];
	}
	void assign(int k,D d){
		k+=N;
		val[k]=d;
		k/=2;
		while(k){
			val[k] = val[k*2] + val[k*2+1];
			k/=2;
		}
	}
	D sum(int a,int b){		//non-commutative & unrecursive
		D res = 0;
		a+=N,b+=N;
		while(a<b){
			if(a&1) res += val[a++];
			if(b&1) res += val[--b];
			a/=2,b/=2;
		}
		return res;
	}
};
int main(){
	int N,Q;
	cin >> N >> Q;
	V<int> a(N);
	rep(i,N) cin >> a[i], a[i]--;
	using P = pair<int,int>;
	VV<P> l2qr(N);
	rep(i,Q){
		int t,l,r;
		cin >> t >> l >> r;
		l--;
		l2qr[l].pb(P(i,r));
	}

	segtree seg(N);
	stack<int> st;
	V<int> ans(Q);

	for(int l=N-1;l>=0;l--){
		while(!st.empty() && a[st.top()] < a[l]){
			seg.assign(st.top(),0);
			st.pop();
		}
		st.push(l);
		seg.assign(l,1);

		for(P qr: l2qr[l]){
			int q = qr.fs, r = qr.sc;
			ans[q] = seg.sum(l,r);
		}
	}
	rep(i,Q) cout << ans[i] << endl;
}