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 blksz = 300;
struct query {
  int l, r, id;
  bool operator<(query q) const {
    if (l / blksz == q.l / blksz) {
      return r < q.r;
    }
    return l / blksz < q.l / blksz;
  }
};
int N, Q;
int arr[100005];
int fre[100005];
int ans[100005];
query qu[100005];
int main() {
  cin >> N >> Q;
  for (int i = 1; i <= N; i++) {
    cin >> arr[i];
  }
  int l = 1, r = 0;
  for (int i = 1; i <= Q; i++) {
    int l, r;
    cin >> l >> r;
    qu[i] = {l, r, i};
  }
  sort(qu + 1, qu + 1 + Q);
  int cnt = 0;
  for (int i = 1; i <= Q; i++) {
    query q = qu[i];
    while (r < q.r) {
      ++r;
      if (arr[r] <= N) {
        fre[arr[r]]++;
        if (fre[arr[r]] == arr[r]) {
          cnt++;
        }
        if (fre[arr[r]] == arr[r] + 1) {
          cnt--;
        }
      }
    }
    while (l < q.l) {
      if (arr[l] <= N) {
        fre[arr[l]]--;
        if (fre[arr[l]] == arr[l]) {
          cnt++;
        }
        if (fre[arr[l]] == arr[l] - 1) {
          cnt--;
        }
      }
      l++;
    }
    while (r > q.r) {
      if (arr[r] <= N) {
        fre[arr[r]]--;
        if (fre[arr[r]] == arr[r]) {
          cnt++;
        }
        if (fre[arr[r]] == arr[r] - 1) {
          cnt--;
        }
      }
      r--;
    }
    while (l > q.l) {
      l--;
      if (arr[l] <= N) {
        fre[arr[l]]++;
        if (fre[arr[l]] == arr[l]) {
          cnt++;
        }
        if (fre[arr[l]] == arr[l] + 1) {
          cnt--;
        }
      }
    }
    ans[q.id] = cnt;
  }
  for (int i = 1; i <= Q; i++) {
    printf("%d\n", ans[i]);
  }
}
