#include<bits/stdc++.h>
using namespace std;
using ll =long long;

#include<atcoder/fenwicktree>
using namespace atcoder;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N,Q;
    cin>>N>>Q;
    vector<ll> P(N);
    vector<ll> IP(N);
    for(int i=0;i<N;i++){
        cin>>P[i];
        P[i]--;
        IP[P[i]]=i;
    }
    vector<vector<array<ll,2>>> query(N);
    for(int q=0;q<Q;q++){
        ll L,R;
        cin>>L>>R;
        L--;
        query[L].push_back({R,q});
    }
    priority_queue<array<ll,2>,vector<array<ll,2>>,greater<array<ll,2>>> PQ;
    vector<vector<ll>> LZ(N);
    for(ll i=N-1;i>=0;i--){
        while(!PQ.empty()){
            auto [n,id]=PQ.top();
            if(n>P[i])break;
            PQ.pop();
            LZ[i].emplace_back(id);
        }
        PQ.push({P[i],i});
    }
    vector<ll> AN(Q);
    fenwick_tree<ll> FW(N);
    for(int i=N-1;i>=0;i--){
        for(auto id:LZ[i])FW.add(id,1);
        for(auto [R,id]:query[i]){
            AN[id]=FW.sum(i,R);
        }
    }
    for(int i=0;i<Q;i++)cout<<AN[i]<<"\n";

}