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 blockSize;
long long cnt[100005];
long long ans[100005];
struct Query {
  long long L, R, idx;
};
bool compare(Query x, Query y) {
  if (x.L / blockSize != y.L / blockSize)
    return x.L / blockSize < y.L / blockSize;
  return x.R < y.R;
}
void queryResults(long long a[], long long n, Query q[], long long m) {
  blockSize = (long long)sqrt(n);
  sort(q, q + m, compare);
  long long currL = 0, currR = 0;
  long long currCnt = 0;
  for (long long i = 0; i < m; i++) {
    long long L = q[i].L, R = q[i].R;
    while (currL < L) {
      if (a[currL] > 100000) {
        currL++;
        continue;
      }
      if (cnt[a[currL]] == a[currL]) currCnt--;
      cnt[a[currL]]--;
      if (cnt[a[currL]] == a[currL]) currCnt++;
      currL++;
    }
    while (currL > L) {
      if (a[currL - 1] > 100000) {
        currL--;
        continue;
      }
      if (cnt[a[currL - 1]] == a[currL - 1]) currCnt--;
      cnt[a[currL - 1]]++;
      if (cnt[a[currL - 1]] == a[currL - 1]) currCnt++;
      currL--;
    }
    while (currR <= R) {
      if (a[currR] > 100000) {
        currR++;
        continue;
      }
      if (cnt[a[currR]] == a[currR]) currCnt--;
      cnt[a[currR]]++;
      if (cnt[a[currR]] == a[currR]) currCnt++;
      currR++;
    }
    while (currR > R + 1) {
      if (a[currR - 1] > 100000) {
        currR--;
        continue;
      }
      if (cnt[a[currR - 1]] == a[currR - 1]) currCnt--;
      cnt[a[currR - 1]]--;
      if (cnt[a[currR - 1]] == a[currR - 1]) currCnt++;
      currR--;
    }
    ans[q[i].idx] = currCnt;
  }
  for (long long i = 0; i < m; i++) cout << ans[i] << endl;
}
int main() {
  long long n, m;
  cin >> n >> m;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  Query q[m];
  for (long long i = 0; i < m; i++) {
    cin >> q[i].L >> q[i].R;
    q[i].L--;
    q[i].R--;
    q[i].idx = i;
  }
  queryResults(a, n, q, m);
  return 0;
}
