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 const mod = 1e9 + 7;
long long const sz = 1e5 + 5;
long long const lim = 1e7 + 5;
long long n, q, k, sol;
long long arr[sz + 5], ans[sz + 5], freqar[lim + 5];
map<long long, long long> freqmp;
struct Query {
  int idx, l, r;
  bool operator<(Query const &ob) const {
    return make_pair(l / k, r) < make_pair(ob.l / k, ob.r);
  }
} query[sz];
void add(long long idx) {
  if (arr[idx] <= lim) {
    freqar[arr[idx]] += 1;
    long long x = freqar[arr[idx]];
    if (x == arr[idx]) sol += 1;
    if (arr[idx] + 1 == x) sol -= 1;
  } else {
    freqmp[arr[idx]] += 1;
    long long x = freqmp[arr[idx]];
    if (x == arr[idx]) sol += 1;
    if (arr[idx] + 1 == x) sol -= 1;
  }
}
void remov(long long idx) {
  if (arr[idx] <= lim) {
    freqar[arr[idx]] -= 1;
    long long x = freqar[arr[idx]];
    if (x == arr[idx]) sol += 1;
    if (x == arr[idx] - 1) sol -= 1;
  } else {
    freqmp[arr[idx]] -= 1;
    long long x = freqmp[arr[idx]];
    if (x == arr[idx]) sol += 1;
    if (x == arr[idx] - 1) sol -= 1;
  }
}
void solve() {
  scanf("%d %d", &n, &q);
  for (int i = 0; i < n; i++) scanf("%I64d", &arr[i]);
  k = sqrt(n);
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &query[i].l, &query[i].r);
    query[i].idx = i;
    --query[i].l, --query[i].r;
  }
  sort(query, query + q);
  long long l = 0, r = -1;
  for (int i = 0; i < q; i++) {
    while (r < query[i].r) add(++r);
    while (l < query[i].l) remov(l++);
    while (r > query[i].r) remov(r--);
    while (l > query[i].l) add(--l);
    ans[query[i].idx] = sol;
  }
  for (int i = 0; i < q; i++) printf("%I64d\n", ans[i]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int t = 1, no = 0;
  while (t--) {
    solve();
  }
  return 0;
}
