#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

// 検証しなおしたい

//library
typedef long long cost_t;

class Edge {
public:
	int to = -1;
	cost_t cost = -1;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	// Edge(int x, int y, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// }

	// Edge(int x, int y, int r, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// 	// rev = r;
	// }

	bool operator< (const Edge& x) const {
		if(cost != x.cost) return cost < x.cost;
		return to < x.to;
	}

	bool operator> (const Edge& x) const {
		if(cost != x.cost) return cost > x.cost;
		return to > x.to;
	}
};

class Graph {
private:
	typedef vector<Edge> Edges;
	//const long long int INF = (long long)1e18;
	vector<Edges> v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<Edges>(x);
	}

	Graph(){}

	Edges& operator[](int x){
		return v[x];
	}

	const Edges& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, const Edge &e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost = -1){
		add_edge(from,Edge(to,cost));
	}

	// void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
	// 	add_edge(from,Edge(from,to,rev,cost));
	// }

	void add_uedge(int from, int to, cost_t cost = -1){
		add_edge(from,to,cost);
		add_edge(to,from,cost);
	}
};

class GraphVizualizer{
	int cnt;
public:
	GraphVizualizer(){
		cnt = 0;
	}

	void operator() (const Graph &g, bool with_dir = true, bool with_cap = false){
		ofstream ofs("./out.dot");
		if(!with_dir) ofs << "graph graph_name {" << endl;
		else ofs << "digraph graph_name {" << endl;
		for(int i = 0; i < (int)g.size(); ++i) {
			ofs << "    " << i << "[];" << endl;
		}
		for(int i = 0; i < (int)g.size(); i++){
			if (!g[i].size())
				continue;
			for(const auto &e : g[i]){
				if(!with_dir){
					if(e.to > i) ofs << "    " << i << " -- " << e.to ; 
				}else ofs << "    " << i << " -> " << e.to ; 
				
				if (with_cap) {
					ofs << " [ label = \"" << (e.cost  == INF ? "inf" : to_string(e.cost)) << "\"];"; 
				}
				if(with_dir or e.to > i)ofs << endl;
			}
		}
		ofs << "}" << endl;
		ofs.close();
		string cmd = "dot -T png out.dot > ";
		cmd = cmd+"sample"+to_string(cnt)+".png";
		system(cmd.c_str());	
		cnt++;
	}
};

//library

template <typename T>
class Segtree {
private:

public:
	vector<T> dat;
	T init;
	int n;
	function<T(T,T)> f;
	// T f(T x, T y){
	// 	return ;
	// }

	Segtree(int n_, T init_, function<T(T,T)> f_){
		init = init_; //単位元を代入させる。
		n = 1;
		f = f_;
		while(n_ > n){
			n <<= 1;
		}
		dat = vector<T>(2*n);
		for(int i = 0; i < 2*n; i++){
			dat[i] = init;
		}
	}

	void update(int k, T a){
		k += n-1;
		dat[k] = a;
		while(k > 0){
			k = (k-1)/2;
			dat[k] = f(dat[2*k+1],dat[2*k+2]);
		}
	}

	T _query(int a, int b, int k, int l, int r){
		if(r <= a || b <= l) return  init;

		if(a <= l && r <= b)	return dat[k];
		else{
			T vl = _query(a, b, k*2+1, l, (l+r)/2);
			T vr = _query(a, b, k*2+2, (l+r)/2, r);
			return f(vl,vr);
		}
	}

	T query(int a, int b){
		return _query(a, b, 0, 0, n);
	}
};



int main()
{
	ios_init();
	int n, q;
	// GraphVizualizer viz;
	while(cin >> n >> q) {
		vector<LL> a(n);
		REP(i, n) cin >> a[i];
		vector<P> lr(q);
		REP(i, q) {
			int t, l, r;
			cin >> t >> l >> r;
			lr[i] = {l - 1, r};
		}
		
		auto za = a;
		sort(ALL(za));
		za.erase(unique(ALL(za)), za.end());
		Graph g(n);
		const int INF = 1e7;
		Segtree<int> seg(SZ(za), INF, [&](int x, int y) { return min(x, y); });
		RREP(i, n) {
			DEBUG(i);
			int k = lower_bound(ALL(za), a[i]) - za.begin();
			DEBUG(k);
			int j = seg.query(k + 1, SZ(za));
			DEBUG(j);
			if(j != INF) g.add_uedge(i, j);
			seg.update(k, i);
			dpite(ALL(seg.dat));
		}
		// viz(g);


		vector<vector<P>> qv(n);
		REP(i, q) {
			qv[lr[i].F].emplace_back(lr[i].S, i);
		}
		vector<int> ans(q);
		using heap = priority_queue<P, vector<P>, greater<P>>;
		
		vector<bool> used(n, false);
		function<void(int, int, heap&)> rec = [&](int cur, int dep, heap &qu) {
			if(used[cur]) return;
			used[cur] = true;
			for(auto&& e : g[cur]) {
				rec(e.to, dep + 1, qu);
			}
			DEBUG(cur);
			dpite(ALL(qv[cur]));
			for(auto&& e : qv[cur]) {
				DEBUG(e);
				ans[e.S] += dep;
				qu.push(e);
			}
			while(!qu.empty() and qu.top().F <= cur) {
				DEBUG(qu.top());
				ans[qu.top().S] -= dep; 
				qu.pop();
			}
		};

		RREP(i, n) {
			heap qu;
			rec(i, 1, qu);
		}

		REP(i, q) {
			cout << ans[i] << endl;
		}
	}
	return 0;
}