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;
struct query {
  int l, r, id;
} q[1000005];
int n, k, cnt[100005], a[100005], ans[100005], res, s, block[100005];
bool cmp(query a, query b) {
  return (block[a.l] < block[b.l]) || (block[a.l] == block[b.l] && a.r < b.r);
}
void adds(int pos) {
  if (a[pos] <= n) {
    if (++cnt[a[pos]] == a[pos]) res++;
    if (cnt[a[pos]] == a[pos] + 1) res--;
  }
}
void removes(int pos) {
  if (a[pos] <= n) {
    if (--cnt[a[pos]] == a[pos] - 1) res--;
    if (cnt[a[pos]] == a[pos]) res++;
  }
}
int main() {
  cin >> n >> k;
  s = sqrt(n);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= k; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].id = i;
    block[q[i].l] = q[i].l / s;
  }
  sort(q + 1, q + 1 + k, cmp);
  int curl = 1, curr = 1;
  if (a[1] <= n) {
    if (++cnt[a[1]] == a[1]) res++;
  }
  for (int i = 1; i <= k; i++) {
    while (curl < q[i].l) {
      removes(curl);
      curl++;
    }
    while (curl > q[i].l) {
      curl--;
      adds(curl);
    }
    while (curr < q[i].r) {
      curr++;
      adds(curr);
    }
    while (curr > q[i].r) {
      removes(curr);
      curr--;
    }
    ans[q[i].id] = res;
  }
  for (int i = 1; i <= k; i++) cout << ans[i] << endl;
}
