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>
const int N = 100100;
using namespace std;
struct query {
  int l, r, idx;
};
int a[N];
int BLOCK_SIZE;
int res[N];
query q[N];
int cnt[N];
int curr_ans;
inline bool cmp(const query &a, const query &b) {
  int blck1 = a.l / BLOCK_SIZE;
  int blck2 = b.l / BLOCK_SIZE;
  if (blck1 != blck2) return (blck1 < blck2);
  return (a.r < b.r);
}
inline void remove(int x) {
  if (x > 100000) return;
  int val = (--cnt[x]);
  if (val == x - 1) curr_ans--;
  if (val == x) curr_ans++;
}
inline void add(int x) {
  if (x > 100000) return;
  int val = (++cnt[x]);
  if (val == x + 1) curr_ans--;
  if (val == x) curr_ans++;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  BLOCK_SIZE = (int)sqrt(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < m; i++) {
    int l, r;
    cin >> l >> r;
    q[i] = {l - 1, r - 1, i};
  }
  sort(q, q + m, cmp);
  int lt = 0, rt = -1;
  for (int i = 0; i < m; i++) {
    int l_next = q[i].l;
    int r_next = q[i].r;
    while (lt < l_next) {
      remove(a[lt]);
      lt++;
    }
    while (lt > l_next) {
      lt--;
      add(a[lt]);
    }
    while (rt < r_next) {
      rt++;
      add(a[rt]);
    }
    while (r_next < rt) {
      remove(a[rt]);
      rt--;
    }
    res[q[i].idx] = curr_ans;
  }
  for (int i = 0; i < m; i++) cout << res[i] << '\n';
  return 0;
}
