#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
  int n,q;
  cin >> n >> q;
  vector<int>a(n);
  map<int,int>dict;
  for(int i=0;i<n;i++)cin >> a[i];
  {
    vector<int>b=a;
    sort(b.begin(),b.end());
    int cnt=0;
    for(int i=0;i<n-1;i++){
      dict[b[i]]=cnt;
      if(b[i]!=b[i+1])cnt++;
    }
    dict[b[n-1]]=cnt;
  }
  for(;q--;){
    int x,y;
    cin >> x >> y;
    cout << max(0,dict[a[x-1]]-dict[a[y-1]]-1) << endl;
  }
}