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;
int ara[100009], ans[100009], cnt[100009], answer = 0;
struct query {
  int l, r, i;
} qry[100009];
bool compare(query a, query b) {
  if (a.l / 320 != b.l / 320) {
    return a.l / 320 < b.l / 320;
  }
  return a.r < b.r;
}
void del(int indx) {
  if (ara[indx] > 100000) return;
  cnt[ara[indx]]--;
  if (cnt[ara[indx]] == ara[indx] - 1) answer--;
  if (cnt[ara[indx]] == ara[indx]) answer++;
}
void add(int indx) {
  if (ara[indx] > 100000) return;
  cnt[ara[indx]]++;
  if (cnt[ara[indx]] == ara[indx]) answer++;
  if (cnt[ara[indx]] == ara[indx] + 1) answer--;
}
int main() {
  int n, q;
  scanf("%d %d", &n, &q);
  answer = 0;
  for (int i = 0; i < n; i++) scanf("%d", &ara[i]);
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &qry[i].l, &qry[i].r);
    qry[i].l--;
    qry[i].r--;
    qry[i].i = i;
  }
  sort(qry, qry + q, compare);
  int curl = 0, curr = 0;
  for (int i = 0; i < q; i++) {
    while (curl < qry[i].l) {
      del(curl);
      curl++;
    }
    while (curl > qry[i].l) {
      add(curl - 1);
      curl--;
    }
    while (curr <= qry[i].r) {
      add(curr);
      curr++;
    }
    while (curr > qry[i].r + 1) {
      del(curr - 1);
      curr--;
    }
    ans[qry[i].i] = answer;
  }
  for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
  for (int i = 0; i <= 100000; i++) cnt[i] = 0;
  return 0;
}
