#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, q; cin >> n >> q;
  vector<int> a(n);
  for (int& a_i : a) cin >> a_i;
  map<int, vector<int>> runners;
  REP(i, n) runners[a[i]].emplace_back(i);
  const int m = runners.size();
  vector<int> b;
  b.reserve(m);
  for (const int a_i : runners | views::keys) b.emplace_back(a_i);
  vector<int> num(m + 1, 0);
  REP(i, m) num[i + 1] = num[i] + runners[b[i]].size();
  // REP(i, m) cout << b[i] << " \n"[i + 1 == m];
  // REP(i, m + 1) cout << num[i] << " \n"[i == m];
  while (q--) {
    int x, y; cin >> x >> y; --x; --y;
    if (a[x] <= a[y]) {
      cout << 0 << '\n';
    } else {
      cout << num[distance(b.begin(), ranges::lower_bound(b, a[x]))] - num[distance(b.begin(), ranges::lower_bound(b, a[y])) + 1] << '\n';
    }
  }
  return 0;
}