#include <bits/stdc++.h>
using namespace std;
long long n,q,a[100000001],b[100000001],x,y,l,r;
int main() {
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        b[i]=a[i];
    }
    sort(b+1,b+n+1);
    while(q--){
        cin>>x>>y;
        if(a[x]<=a[y]) cout<<0<<"\n";
        else {
            l=upper_bound(b+1,b+n+1,a[y])-b;
            r=lower_bound(b+1,b+n+1,a[x])-b;
            cout<<r-l<<"\n";
        }
    }
}