#include <bits/stdc++.h>
using namespace std;
const int N = 101000;
int t[N];
void inc(int i, int x) {
  for (; i < N; i |= i + 1) t[i] += x;
}
int sum(int i) {
  int r = 0;
  for (; i >= 0; i &= i + 1, i--) r += t[i];
  return r;
}
int sum(int i, int j) { return sum(j) - sum(i - 1); }
int a[N], s[N], n, k, m, res[N], id[N];
vector<int> pl[N];
pair<pair<int, int>, int> q[N];
int indx(int x) { return lower_bound(s, s + k, x) - s; }
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
    s[i] = a[i];
  }
  sort(s, s + n);
  k = unique(s, s + n) - s;
  for (int i = 0; i < n; i++) pl[indx(a[i])].push_back(i);
  for (int i = 0; i < m; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    l--;
    r--;
    q[i] = make_pair(make_pair(r, l), i);
  }
  sort(q, q + m);
  int j = 0;
  for (int i = 0; i < m; i++) {
    int l, r, I;
    l = q[i].first.second;
    r = q[i].first.first;
    I = q[i].second;
    for (; j <= r; j++) {
      int x = a[j], ix = indx(x);
      int &thatIdx = id[ix];
      if (pl[ix][thatIdx] != j) cout << "FUU" << endl;
      if (thatIdx - x - 1 >= 0) {
        inc(pl[ix][thatIdx - x - 1], 1);
      }
      if (thatIdx - x >= 0) {
        inc(pl[ix][thatIdx - x], -2);
      }
      if (thatIdx - x + 1 >= 0) {
        inc(pl[ix][thatIdx - x + 1], 1);
      }
      thatIdx++;
    }
    res[I] = sum(l, r);
  }
  for (int i = 0; i < m; i++) printf("%d\n", res[i]);
  return 0;
}
