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 k, sum = 0;
struct query {
  long long l, r, ind;
};
query Q[100005];
long long cnt[100005];
long long summ[100005];
vector<long long> v;
bool cmp(query a, query b) {
  long long bl_a = a.l / k;
  long long bl_b = b.l / k;
  if (bl_a == bl_b) {
    return (a.r < b.r);
  }
  return bl_a < bl_b;
}
void add(long long val) {
  if (val > 100000) {
    return;
  }
  if (cnt[val] == val) {
    sum--;
  }
  cnt[val]++;
  if (cnt[val] == val) {
    sum++;
  }
}
void rem(long long val) {
  if (val > 100000) {
    return;
  }
  if (cnt[val] == val) {
    sum--;
  }
  cnt[val]--;
  if (cnt[val] == val) {
    sum++;
  }
}
int main() {
  long long n, q, x, l = 0, r = -1;
  scanf("%lld", &n);
  ;
  scanf("%lld", &q);
  ;
  k = sqrt(n) + 1;
  while (n--) {
    scanf("%lld", &x);
    ;
    v.push_back(x);
  }
  for (long long i = 0; i < q; i++) {
    scanf("%lld", &Q[i].l);
    ;
    scanf("%lld", &Q[i].r);
    ;
    Q[i].ind = i;
  }
  sort(Q, Q + q, cmp);
  for (long long i = 0; i < q; i++) {
    while (Q[i].l - 1 < l) {
      l--;
      add(v[l]);
    }
    while (Q[i].l - 1 > l) {
      rem(v[l]);
      l++;
    }
    while (Q[i].r - 1 > r) {
      r++;
      add(v[r]);
    }
    while (Q[i].r - 1 < r) {
      rem(v[r]);
      r--;
    }
    summ[Q[i].ind] = sum;
  }
  for (long long i = 0; i < q; i++) {
    printf("%lld", summ[i]);
    ;
    printf("\n");
    ;
  }
}
