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 N, Q;
long long current_answer;
long long cnt[100005];
long long answers[100500];
int BLOCK_SIZE;
int arr[100500];
pair<pair<int, int>, int> queries[100500];
inline bool mo_cmp(const pair<pair<int, int>, int> &x,
                   const pair<pair<int, int>, int> &y) {
  int block_x = x.first.first / BLOCK_SIZE;
  int block_y = y.first.first / BLOCK_SIZE;
  if (block_x != block_y) return block_x < block_y;
  return x.first.second < y.first.second;
}
inline void add(int x) {
  cnt[x]++;
  if (cnt[x] == x) current_answer++;
  if (cnt[x] == x + 1) current_answer--;
}
inline void remove(int x) {
  cnt[x]--;
  if (cnt[x] == x) current_answer++;
  if (cnt[x] == x - 1) current_answer--;
}
int main() {
  cin.sync_with_stdio(false);
  cin >> N >> Q;
  BLOCK_SIZE = static_cast<int>(sqrt(N));
  for (int i = 0; i < N; i++) {
    cin >> arr[i];
    if (arr[i] >= 100001) arr[i] = 100001;
  }
  for (int i = 0; i < Q; i++) {
    cin >> queries[i].first.first >> queries[i].first.second;
    queries[i].first.first--;
    queries[i].first.second--;
    queries[i].second = i;
  }
  sort(queries, queries + Q, mo_cmp);
  int mo_left = 0, mo_right = -1;
  current_answer = 0;
  for (int i = 0; i < Q; i++) {
    int left = queries[i].first.first;
    int right = queries[i].first.second;
    while (mo_right < right) {
      mo_right++;
      add(arr[mo_right]);
    }
    while (mo_right > right) {
      remove(arr[mo_right]);
      mo_right--;
    }
    while (mo_left < left) {
      remove(arr[mo_left]);
      mo_left++;
    }
    while (mo_left > left) {
      mo_left--;
      add(arr[mo_left]);
    }
    answers[queries[i].second] = current_answer;
  }
  for (int i = 0; i < Q; i++) cout << answers[i] << "\n";
  return 0;
}
