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

int N, Q, A[101010], pos[101010];
map<int, int> mp;

int main() {
  cin >> N >> Q;
  for (int i = 1; i <= N; i++) cin >> A[i];
  for (int i = 1; i <= N; i++) pos[i] = i;
  sort(pos + 1, pos + N + 1, [&](int a, int b) {
    return A[a] < A[b];
  });
  for (int i = 1; i <= N; i++) mp[pos[i]] = i;
  while (Q--) {
    int x, y; cin >> x >> y;
    if (A[x] <= A[y]) cout << 0 << endl;
    else cout << mp[x] - mp[y] - 1 << endl;
  }
  return 0;
}