#include <bits/stdc++.h>
using namespace std;
struct Cnt {
  int num;
  int count;
} cnt[501];
int len = 0;
int a[100005] = {0};
int tmp[100005] = {0};
int sum[501][100005] = {0};
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  memcpy(tmp, a, sizeof(tmp));
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n && a[i] <= n; i++) {
    int c = 1;
    while (a[i] == a[i + 1]) c++, i++;
    if (c < a[i]) continue;
    cnt[len++] = {a[i], c};
  }
  for (int i = 1; i <= n; i++) {
    bool find = false;
    int k = 0;
    for (int j = 0; j < len; j++) {
      if (cnt[j].num == tmp[i]) {
        find = true, k = j;
        break;
      }
    }
    if (find) sum[k][i]++;
    for (int j = 0; j < len; j++) {
      sum[j][i] += sum[j][i - 1];
    }
  }
  for (int i = 1; i <= m; i++) {
    int l, r;
    cin >> l >> r;
    int ans = 0;
    for (int j = 0; j < len; j++) {
      if (sum[j][r] - sum[j][l - 1] == cnt[j].num) ans++;
    }
    cout << ans << "\n";
  }
  return 0;
}
