#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, q;
  cin >> n >> q;
  vector<ll> a(n), r(n), cnt(n);
  rep(i, n) cin >> a[i];
  {
    vector<pair<ll, ll>> b(n);
    rep(i, n) b[i] = {a[i], i};
    sort(b.begin(), b.end());
    ll now = 0, d = 0;
    rep(i, n) {
      auto [cd, x] = b[i];
      if (d < cd) {
        d = cd;
        now = i;
      }
      r[x] = now;
      cnt[now]++;
    }
  }
  rep(qi, q) {
    ll x, y;
    cin >> x >> y, x--, y--;
    ll ans = 0;
    if (r[y] < r[x])
      ans = r[x] - r[y] - cnt[r[y]];
    cout << ans << '\n';
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}