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;
int current_answer = 0;
unordered_map<int, int> cnt;
int answers[100005];
int BLOCK_SIZE = 300;
int arr[100005];
struct Query {
  int left;
  int right;
  int pos;
  bool operator<(const Query &y) const {
    if (left / BLOCK_SIZE != y.left / BLOCK_SIZE) return left < y.left;
    return (right < y.right) ^ ((left / BLOCK_SIZE) & 1);
  }
} queries[100005];
inline void addOperation(int x) {
  cnt[x]++;
  if (cnt[x] == x)
    current_answer++;
  else if (cnt[x] == x + 1)
    current_answer--;
}
inline void removeOperation(int x) {
  cnt[x]--;
  if (cnt[x] == x)
    current_answer++;
  else if (cnt[x] + 1 == x)
    current_answer--;
}
int main() {
  scanf("%d %d", &N, &Q);
  for (int i = 0; i < N; i++) scanf("%d", &arr[i]);
  for (int i = 0; i < Q; i++) {
    scanf("%d %d", &queries[i].left, &queries[i].right);
    queries[i].left--;
    queries[i].right--;
    queries[i].pos = i;
  }
  sort(queries, queries + Q);
  int mo_left = 0, mo_right = -1;
  int x;
  for (int i = 0; i < Q; i++) {
    int left = queries[i].left;
    int right = queries[i].right;
    while (mo_right < right) {
      mo_right++;
      addOperation(arr[mo_right]);
    }
    while (mo_right > right) {
      removeOperation(arr[mo_right]);
      mo_right--;
    }
    while (mo_left < left) {
      removeOperation(arr[mo_left]);
      mo_left++;
    }
    while (mo_left > left) {
      mo_left--;
      addOperation(arr[mo_left]);
    }
    answers[queries[i].pos] = current_answer;
  }
  for (int i = 0; i < Q; i++) printf("%d\n", answers[i]);
  return 0;
}
