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

struct UnionFind
{
  vector< int > data;

  UnionFind(int sz)
  {
    data.assign(sz, -1);
  }

  bool unite(int x, int y)
  {
    x = find(x), y = find(y);
    if(x == y) return(false);
    if(data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return(true);
  }

  int find(int k)
  {
    if(data[k] < 0) return(k);
    return(data[k] = find(data[k]));
  }

  int size(int k)
  {
    return(-data[find(k)]);
  }
};

int main(){
  int N,Q;
  cin >> N >> Q;
  vector<int> A;
  map<int,int> mp;
  for(int i=0;i<N;i++){
    int a;
    cin >> a;
    A.push_back(a);
    mp[i] = a;
  }
  sort(A.begin(),A.end());
  for(int i=0;i<Q;i++){
    int x,y;
    cin >> x >> y;
    x--;y--;
    if(mp[x]<=mp[y]){
      cout << 0 << endl;
      continue;
    }
    auto first = lower_bound(A.begin(),A.end(),mp[x]);
    auto last = upper_bound(A.begin(),A.end(),mp[y]);
    cout << (first-last) << endl;
  }
}