#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int op(int a, int b) { return min(a, b); }
int e() { return INF; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<int>a(n);
	rep(i, n)cin >> a[i], a[i]--;
	segtree<int, op, e>seg(n);
	vector<int>b(n);
	rrep(i, n) {
		b[i] = seg.prod(a[i], n);
		if (INF == b[i])b[i] = n;
		seg.set(a[i], i);
	}
	int sz = 20;
	vector<vector<int>>dp(sz, vector<int>(n + 1, n));
	rep(i, n)dp[0][i] = b[i];
	rep2(i, 1, sz) {
		rep(j, n) {
			dp[i][j] = dp[i - 1][dp[i - 1][j]];
		}
	}
	while (q--) {
		int t, l, r; cin >> t >> l >> r;
		l--, r--;
		int ans = 1;
		rrep(i, sz) {
			if (dp[i][l] <= r) {
				ans += 1 << i;
				l = dp[i][l];
			}
		}
		cout << ans << endl;
	}
	return 0;
}