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

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using pii = pair<int, int>;

int main() {
  int N, Q;
  cin >> N >> Q;
  vector<pii> A(N);
  rep(i, N) {
    int Ai;
    cin >> Ai;
    A[i] = {Ai, i};
  }
  sort(A.begin(), A.end());
  vector<int> C(N, 0);
  rep(i, N-1) {
    if (A[i+1].first == A[i].first) {
      C[i] = C[i+1] = 1;
    }
  }
  vector<int> B(N);
  rep(i, N) {
    B[A[i].second] = i;
  }
  rep(i, Q) {
    int x, y;
    cin >> x >> y;
    x--; y--;
    int dif = B[x] - B[y] - 1;
    if (B[x]+1 >= 0 && C[B[x]] > 0 && C[B[x]-1] > 0)
      dif--;
    if (B[y]-1 < N && C[B[y]] > 0 && C[B[y]+1] > 0)
      dif--;
    if (dif < 0) dif = 0;
    cout << dif << endl;
  }
  return 0;
}