#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using i8 = int8_t;
using i32 = int;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;
using ll = long long;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res *= x;
    x *= x;
    n >>= 1;
  }
  return res;
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}

const i64 inf = 1ll << 60;

void _main() {
  i64 n, q;
  cin >> n >> q;
  vector<i64> a(n);
  for (i64 i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<i64> b = a;
  sort(b.begin(), b.end());
  for (i64 _ = 0; _ < q; _++) {
    i64 x, y;
    cin >> x >> y;
    x--, y--;
    if (a[x] <= a[y]) {
      cout << "0\n";
    } else {
      i64 s = upper_bound(b.begin(), b.end(), a[y]) - b.begin();
      i64 t = lower_bound(b.begin(), b.end(), a[x]) - b.begin();
      cout << t - s << "\n";
    }
  }
}