#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

template <typename T> class SegmentTreeRangeMaximumQuery{
private:
  int size;
  vector<T> vec;
  T e;
  
  inline T aux(int x, int y, int i, int l, int r){
    if(r<=x || y<=l) return e;
    else if(x<=l && r<=y) return vec[i];
    else return max(aux(x,y,i*2+1,l,(l+r)/2), aux(x,y,i*2+2,(l+r)/2,r));
  };

public:
  SegmentTreeRangeMaximumQuery(int n, const T &e): e(e){
    size = 1;
    while(size < n) size *= 2;
    size = size*2-1;
    vec = vector<T>(size, e);
  }

  inline void update(int i, const T &x){
    int j = i+(size+1)/2-1;
    vec[j] = x;
    --j;
    while(j>=0){
      vec[j/2] = max(vec[(j/2)*2+1], vec[(j/2)*2+2]);
      (j /= 2) -= 1;
    }
  }
  
  inline T at(int i){
  	return vec[(size+1)/2 + i - 1];
  }

  inline T get(int x, int y){ // [x,y)
    return aux(x,y,0,0,(size+1)/2);
  }
};

template <typename T> class SegmentTreeRangeSumQuery{
private:
  int size;
  vector<T> vec;
  T e;
  
  inline T aux(int x, int y, int i, int l, int r){
    if(r<=x || y<=l) return e;
    else if(x<=l && r<=y) return vec[i];
    else return aux(x,y,i*2+1,l,(l+r)/2) + aux(x,y,i*2+2,(l+r)/2,r);
  };

public:
  SegmentTreeRangeSumQuery(int n, const T &e): e(e){
    size = 1;
    while(size < n) size *= 2;
    size = size*2-1;
    vec = vector<T>(size, e);
  }

  inline void update(int i, const T &x){
    int j = i+(size+1)/2-1;
    vec[j] = x;
    --j;
    while(j>=0){
      vec[j/2] = vec[(j/2)*2+1] + vec[(j/2)*2+2];
      (j /= 2) -= 1;
    }
  }
  
  inline T at(int i){
  	return vec[(size+1)/2 + i - 1];
  }

  inline T get(int x, int y){ // [x,y)
    return aux(x,y,0,0,(size+1)/2);
  }
};






int main(){
  int N,Q; cin >> N >> Q;
  vector<int> a(N); cin >> a;

  SegmentTreeRangeMaximumQuery<int> seg1(N+1,0);
  vector<pair<int,int>> p;
  REP(i,N){
    seg1.update(a[i],i+1);

    p.push_back(make_pair(seg1.get(a[i]+1,N+1),i));
  }

  sort(RALL(p));


  vector<int> ans(Q);

  vector<tuple<int,int,int>> qs(Q);
  REP(i,Q){
    int c; cin >> c;
    int l,r; cin >> l >> r;
    --l, --r;
    qs[i] = make_tuple(l,r,i);
  }

  sort(ALL(qs));

  SegmentTreeRangeSumQuery<int> seg2(N,0);
  
  for(auto &[l,r,i] : qs){
    while(p.size() and p.back().fst <= l){
      seg2.update(p.back().snd, 1);

      p.pop_back();
    }

    ans[i] = seg2.get(l,r+1);
  }

  REP(i,Q) cout << ans[i] << endl;

  return 0;
}