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;
const int MAXN = (int)1e5 + 7;
const int BSIZE = 333;
struct query {
  int l, r, id;
};
int n, m;
int res[MAXN], a[MAXN];
query q[MAXN];
int getBlock(int x) { return (x - 1) / BSIZE; }
bool cmp(query u, query v) {
  if (getBlock(u.l) != getBlock(v.l)) return getBlock(u.l) < getBlock(v.l);
  return u.r < v.r;
}
int ans;
int cnt[MAXN];
void upd(int x, int val) {
  if (cnt[x] == x) --ans;
  cnt[x] += val;
  if (cnt[x] == x) ++ans;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] > n) a[i] = n + 5;
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &q[i].l, &q[i].r);
    q[i].id = i;
  }
  sort(q + 1, q + m + 1, cmp);
  for (int i = 1; i <= m; i++) {
    if (i == 1 || getBlock(q[i].l) != getBlock(q[i - 1].l)) {
      ans = 0;
      memset(cnt, 0, sizeof cnt);
      for (int g = q[i].l; g <= q[i].r; g++) {
        upd(a[g], 1);
      }
      res[q[i].id] = ans;
    } else {
      for (int g = q[i - 1].r + 1; g <= q[i].r; g++) {
        upd(a[g], 1);
      }
      if (q[i - 1].l < q[i].l) {
        for (int g = q[i - 1].l; g < q[i].l; g++) upd(a[g], -1);
      }
      if (q[i - 1].l > q[i].l) {
        for (int g = q[i - 1].l - 1; g >= q[i].l; g--) upd(a[g], 1);
      }
      res[q[i].id] = ans;
    }
  }
  for (int i = 1; i <= m; i++) printf("%d\n", res[i]);
  return 0;
}
