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 solve() {
  long long n, m;
  cin >> n >> m;
  std::vector<long long> cnt(n + 1);
  std::vector<long long> A(n + 1);
  for (long long i = 1; i <= n; i++) {
    cin >> A[i];
    if (A[i] <= n) cnt[A[i]]++;
  }
  std::vector<long long> V;
  for (long long i = 1; i <= n; i++) {
    if (cnt[i] >= i) V.push_back(i);
  }
  std::vector<long long> L(m), R(m);
  for (long long i = 0; i < m; i++) {
    cin >> L[i] >> R[i];
  }
  std::vector<long long> f(n + 1);
  std::vector<long long> ans(m);
  for (long long i = 0; i < V.size(); i++) {
    for (long long j = 1; j <= n; j++) {
      f[j] = f[j - 1] + (A[j] == V[i]);
    }
    for (long long j = 0; j < m; j++) {
      ans[j] += ((f[R[j]] - f[L[j] - 1]) == V[i]);
    }
  }
  for (long long i = 0; i < m; i++) cout << ans[i] << endl;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  solve();
  return 0;
}
