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

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N,Q;
  cin>>N>>Q;
  vector A(N,0);
  for(int &i:A)cin>>i,i*=-1;
  auto B=A;
  sort(B.begin(),B.end());
  while(Q--){
    int X,Y;
    cin>>X>>Y;
    --X,--Y;
    int ans=(int)(lower_bound(B.begin(),B.end(),A[Y])-B.begin())-(int)(upper_bound(B.begin(),B.end(),A[X])-B.begin());
    ans=max(ans,0);
    cout<<ans<<'\n';
  }
}