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 + 5;
const int K = 333;
int a[MaxN], b[MaxN];
pair<pair<int, int>, int> Q[MaxN];
int answer[MaxN];
inline bool mo_comp(const pair<pair<int, int>, int> &x,
                    const pair<pair<int, int>, int> &y) {
  int block_x = x.first.first / K;
  int block_y = y.first.first / K;
  if (block_x != block_y) return block_x < block_y;
  return y.first.second < x.first.second;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    if (a[i] > n) b[i] = -1;
  }
  for (int i = 0; i < q; i++) {
    int x, y;
    cin >> x >> y;
    Q[i].first.first = --x;
    Q[i].first.second = --y;
    Q[i].second = i;
  }
  sort(Q, Q + q, mo_comp);
  int mo_left = 1, mo_right = 0;
  int ans = 0;
  for (int i = 0; i < q; i++) {
    int left = Q[i].first.first;
    int right = Q[i].first.second;
    while (mo_right < right) {
      mo_right++;
      if (a[mo_right] <= MaxN) {
        b[a[mo_right]]++;
        if (b[a[mo_right]] == a[mo_right]) ans++;
        if (b[a[mo_right]] - a[mo_right] == 1) ans--;
      }
    }
    while (mo_right > right) {
      if (a[mo_right] <= MaxN) {
        b[a[mo_right]]--;
        if (b[a[mo_right]] == a[mo_right]) ans++;
        if (b[a[mo_right]] - a[mo_right] == -1) ans--;
      }
      mo_right--;
    }
    while (mo_left < left) {
      if (a[mo_left] <= MaxN) {
        b[a[mo_left]]--;
        if (b[a[mo_left]] == a[mo_left]) ans++;
        if (b[a[mo_left]] - a[mo_left] == -1) ans--;
      }
      mo_left++;
    }
    while (mo_left > left) {
      mo_left--;
      if (a[mo_left] <= MaxN) {
        b[a[mo_left]]++;
        if (b[a[mo_left]] == a[mo_left]) ans++;
        if (b[a[mo_left]] - a[mo_left] == 1) ans--;
      }
    }
    answer[Q[i].second] = ans;
  }
  for (int i = 0; i < q; i++) cout << answer[i] << "\n";
  return 0;
}
