The Little Elephant loves playing with arrays. He has array a, consisting of n positive integers, indexed from 1 to n. Let's denote the number with index i as ai. 

Additionally the Little Elephant has m queries to the array, each query is characterised by a pair of integers lj and rj (1 ≤ lj ≤ rj ≤ n). For each query lj, rj the Little Elephant has to count, how many numbers x exist, such that number x occurs exactly x times among numbers alj, alj + 1, ..., arj.

Help the Little Elephant to count the answers to all queries.

Input

The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 105) — the size of array a and the number of queries to it. The next line contains n space-separated positive integers a1, a2, ..., an (1 ≤ ai ≤ 109). Next m lines contain descriptions of queries, one per line. The j-th of these lines contains the description of the j-th query as two space-separated integers lj and rj (1 ≤ lj ≤ rj ≤ n).

Output

In m lines print m integers — the answers to the queries. The j-th line should contain the answer to the j-th query.

Examples

Input

7 2
3 1 2 2 3 3 7
1 7
3 4


Output

3
1
#include <bits/stdc++.h>
using namespace std;
long long a[100005], cnt[100005];
int ans[100005];
int block;
int answer;
int n, q;
struct queries {
  int l;
  int r;
  int id;
};
queries que[100005];
bool comp(queries q1, queries q2) {
  if (q1.l / block != q2.l / block) return q1.l / block < q2.l / block;
  return q1.r < q2.r;
}
void removed(long id) {
  cnt[a[id]]--;
  if (cnt[a[id]] == a[id]) {
    answer++;
  }
  if (cnt[a[id]] == a[id] - 1) {
    answer--;
  }
}
void add(long id) {
  cnt[a[id]]++;
  if (cnt[a[id]] == a[id]) {
    answer++;
  }
  if (cnt[a[id]] == a[id] + 1) {
    answer--;
  }
}
int main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] > 1e5) {
      a[i] = 100001;
    }
  }
  for (int i = 1; i <= q; i++) {
    int l, r;
    cin >> l >> r;
    que[i].l = l;
    que[i].r = r;
    que[i].id = i;
  }
  block = sqrt(n);
  sort(que + 1, que + q + 1, comp);
  int currl = 1, currr = 1;
  cnt[a[1]] = 1;
  if (a[1] == 1) {
    answer = 1;
  } else
    answer = 0;
  for (int i = 1; i <= q; i++) {
    int l = que[i].l;
    int r = que[i].r;
    while (l < currl) {
      currl--;
      add(currl);
    }
    while (l > currl) {
      removed(currl);
      currl++;
    }
    while (r > currr) {
      currr++;
      add(currr);
    }
    while (r < currr) {
      removed(currr);
      currr--;
    }
    ans[que[i].id] = answer;
  }
  for (int i = 1; i <= q; i++) {
    cout << ans[i] << endl;
  }
}
