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;
typedef struct query {
  int l;
  int r;
  int index;
} Query;
long long int size;
int freq[100005];
int comp(const void* a, const void* b) {
  int x = ((Query*)a)->l / size;
  int y = ((Query*)b)->l / size;
  if (x == y) return ((Query*)a)->r - ((Query*)b)->r;
  return x - y;
}
long long int val[100005];
Query q[100005];
long long int arr[100005];
int main() {
  int n;
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int i;
  cin >> n;
  int t;
  cin >> t;
  for (i = 0; i < n; i++) cin >> arr[i];
  size = (sqrt(n));
  for (i = 0; i < t; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].l--;
    q[i].r--;
    q[i].index = i;
  }
  qsort((void*)q, t, sizeof(q[0]), comp);
  long long int ans = 0;
  int mo_left = 0;
  int mo_right = -1;
  for (i = 0; i < t; i++) {
    while (mo_right < q[i].r) {
      if (arr[mo_right + 1] <= 100000) {
        freq[arr[mo_right + 1]]++;
        if (freq[arr[mo_right + 1]] == arr[mo_right + 1]) ans++;
        if (freq[arr[mo_right + 1]] == arr[mo_right + 1] + 1) ans--;
      }
      mo_right++;
    }
    while (mo_right > q[i].r) {
      if (arr[mo_right] <= 100000) {
        freq[arr[mo_right]]--;
        if (freq[arr[mo_right]] == arr[mo_right]) ans++;
        if (freq[arr[mo_right]] == arr[mo_right] - 1) ans--;
      }
      mo_right--;
    }
    while (mo_left < q[i].l) {
      if (arr[mo_left] <= 100000) {
        freq[arr[mo_left]]--;
        if (freq[arr[mo_left]] == arr[mo_left]) ans++;
        if (freq[arr[mo_left]] == arr[mo_left] - 1) ans--;
      }
      mo_left++;
    }
    while (mo_left > q[i].l) {
      if (arr[mo_left - 1] <= 100000) {
        freq[arr[mo_left - 1]]++;
        if (freq[arr[mo_left - 1]] == arr[mo_left - 1]) ans++;
        if (freq[arr[mo_left - 1]] == arr[mo_left - 1] + 1) ans--;
      }
      mo_left--;
    }
    val[q[i].index] = ans;
  }
  for (i = 0; i < t; i++) cout << val[i] << "\n";
  return 0;
}
