#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

template<typename Monoid>
struct SegmentTree{
    using F=function<Monoid(Monoid,Monoid)>;
    int sz;
    vector<Monoid> seg;
    const F f;
    const Monoid gen;
    SegmentTree(int n,const F f,const Monoid &gen):f(f),gen(gen){
        sz=1;
        while(sz<n)sz<<=1;
        seg.assign(2*sz,gen);
    }
    void set(int k,const Monoid &x){
        seg[k+sz]=x;
    }
    void build(){
        for(int k=sz-1;k>0;k--) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
    void update(int k,const Monoid &x){
        k+=sz;
        seg[k]=x;
        while(k>>=1) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
   // [a,b)
    Monoid query(int a,int b){
        Monoid L=gen,R=gen;
        for(a+=sz,b+=sz;a<b;a>>=1,b>>=1){
            if(a&1) L=f(L,seg[a++]);
            if(b&1) R=f(seg[--b],R);
        }
        return f(L,R);
    }
    Monoid operator[](const int &k)const {
       return seg[k+sz];
    }
};
int f(int a,int b){
    return a+b;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n,q;cin>>n>>q;
    vector<int> a(n),id(n);
    rep(i,n){
        cin>>a[i];
        a[i]--;
        id[a[i]]=i;
    }

    set<int> st;
    vector<vector<int>> v(n);//v[i]: 左端がiの時に入ってるやつj
    v[0].push_back(id[n-1]);st.insert(id[n-1]);
    for(int i=n-2;i>=0;i--){
        auto ite=st.lower_bound(id[i]);
        if(ite==st.begin()) v[0].push_back(id[i]);
        else v[*prev(ite)+1].push_back(id[i]);
        st.insert(id[i]);
    }

    // rep(i,n){
    //     cout<<i<<" : ";
    //     rep(j,v[i].size()) cout<<v[i][j]<<" ";
    //     cout<<endl;
    // }

    vector<vector<pair<int,int>>> qs(n);
    rep(i,q){
        int l,r,unko;cin>>unko>>l>>r;l--,r--;
        qs[l].push_back(make_pair(r,i));
    }
    
    vector<int> ans(q);
    SegmentTree<int> seg(n,f,0);
    rep(i,n){
        for(auto x:v[i])seg.update(x,1);
        for(auto qu:qs[i]) ans[qu.second]=seg.query(i,qu.first+1);
    }
    rep(i,q) cout<<ans[i]<<endl;
    return 0;
}