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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector<vector<ll>> Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() { printf("yes\n"); }
void no() { printf("no\n"); }
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }

int n, q, a[int(1e5 + 5)], x[int(1e5 + 5)], y[int(1e5 + 5)];
Pii p[int(1e5 + 5)];
int ran[int(1e5 + 5)];

int main() {
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    p[i] = {a[i], i};
  }
  sort(p + 1, p + n + 1);

  ran[p[1].second] = 1;
  for (int i = 2; i <= n; i++) {
    if (p[i].first == p[i - 1].first) {
      ran[p[i].second] = ran[p[i - 1].second];
    } else {
      ran[p[i].second] = i;
    }
  }

  for (int i = 1; i <= q; i++) {
    cin >> x[i] >> y[i];
  }

  for (int i = 1; i <= q; i++) {
    cout << max(0, ran[x[i]] - ran[y[i]] - 1) << endl;
  }

  return 0;
}