#include <bits/stdc++.h>
using ll=long long;
const long long INF=1LL<<60;
void Compress(std::vector<ll>& A)
{
    std::vector<ll> B=A;//
    std::sort(B.begin(),B.end());
    B.erase(std::unique(B.begin(),B.end()),B.end());
    for(auto& a:A){
        a=static_cast<ll>(std::lower_bound(B.begin(),B.end(),a)-B.begin());
    }
}
int main(){
    ll n,q;
    std::cin >> n >> q;
    std::vector<ll>A(n);
    for(auto&a:A){
        std::cin >> a;
        a*=-1;
    }
    Compress(A);
    std::vector<ll>sum(n+1);
    for(int i=0;i<n;++i)sum[A[i]]++;
    for(int i=0;i<n;++i)sum[i+1]+=sum[i];
    while(q--){
        ll x,y;
        std::cin >> x >> y;
        --x;--y;
        x=A[x];y=A[y];
        if(y==0)std::cout << 0 << '\n';
        else std::cout << std::max(0LL,sum[y-1]-sum[x]) << '\n';
    }
}