#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  int N, Q; cin >> N >> Q;

  vector<pair<int, int>> A(N);
  for (int i = 0; i < N; i++) {
    int a; cin >> a;
    A[i] = make_pair(a, i);
  }

  vector<int> b(N);
  sort(A.rbegin(), A.rend());
  for (int i = 0; i < N; i++) {
    b[A[i].second] = i;
  }

  while (Q--) {
    int x, y; cin >> x >> y;
    x--; y--;
    int frm = b[x], to = b[y];
    if (frm >= to)
      cout << 0 << endl;
    else
      cout << to - frm - 1 << endl;
  }
  return 0;
}