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;
void rd(long long &x) { scanf("%lld", &x); }
void rd(long long &x, long long &y) { scanf("%lld%lld", &x, &y); }
void rd(long long &x, long long &y, long long &z) {
  scanf("%lld%lld%lld", &x, &y, &z);
}
void rd(long long &x, long long &y, long long &z, long long &s) {
  scanf("%lld%lld%lld%lld", &x, &y, &z, &s);
}
const long long N = 1e5 + 5;
long long n, m, a[N], ans[N], b[N], score, block, cnt[(long long)1e6 + 6];
struct data {
  long long l, r, id;
  data() {}
  data(long long la, long long ra, long long ida) { l = la, r = ra, id = ida; }
  bool operator<(const data &b) const {
    if (l / block == b.l / block) return r < b.r;
    return l / block < b.l / block;
  }
};
data q[N];
void add(long long x) {
  if (x > n) return;
  cnt[x]++;
  if (cnt[x] == x)
    score++;
  else if (cnt[x] == x + 1)
    score--;
}
void remove(long long x) {
  if (x > n) return;
  if (cnt[x] == x)
    score--;
  else if (cnt[x] == x + 1)
    score++;
  cnt[x]--;
}
int main() {
  rd(n, m);
  block = sqrt(n);
  for (long long i = 0; i < (n); i++) rd(a[i]), b[i] = a[i];
  sort(b, b + n);
  long long nw = 0;
  for (long long i = 0; i < (m); i++) {
    rd(q[i].l, q[i].r);
    q[i].l--, q[i].r--;
    q[i].id = i;
  }
  sort(q, q + m);
  long long l = q[0].l, r = q[0].r;
  for (long long i = l; i <= r; i++) add(a[i]);
  ans[q[0].id] = score;
  for (long long i = 1; i <= (m - 1); i++) {
    while (l < q[i].l) remove(a[l++]);
    while (l > q[i].l) add(a[--l]);
    while (r < q[i].r) add(a[++r]);
    while (r > q[i].r) remove(a[r--]);
    ans[q[i].id] = score;
  }
  for (long long i = 0; i < (m); i++) printf("%lld\n", ans[i]);
  return 0;
}
