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;
const int maxn = 1e5 + 10, root = 340;
struct Q {
  int l, r, b, id;
  bool operator<(const Q& o) const {
    if (b != o.b)
      return b < o.b;
    else {
      if (b & 1)
        return r < o.r;
      else
        return r > o.r;
    }
  }
} query[maxn];
int n, m, ans[maxn], v[maxn], freq[maxn];
unordered_map<int, int> M;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) cin >> v[i];
  for (int i = 1; i <= m; ++i) {
    int l, r, b;
    cin >> l >> r;
    b = l / root;
    query[i] = {l, r, b, i};
  }
  sort(query + 1, query + m + 1);
  int li = 0, ri = 0, val = 0;
  for (int i = 1; i <= m; ++i) {
    int l = query[i].l;
    int r = query[i].r;
    int id = query[i].id;
    while (li < l) {
      if (v[li] == M[v[li]] && v[li]) val--;
      if (v[li]) M[v[li]]--;
      if (v[li] == M[v[li]] && v[li]) val++;
      li++;
    }
    while (ri < r) {
      ri++;
      if (v[ri] == M[v[ri]] && v[ri]) val--;
      if (v[ri]) M[v[ri]]++;
      if (v[ri] == M[v[ri]] && v[ri]) val++;
    }
    while (li > l) {
      li--;
      if (v[li] == M[v[li]] && v[li]) val--;
      if (v[li]) M[v[li]]++;
      if (v[li] == M[v[li]] && v[li]) val++;
    }
    while (ri > r) {
      if (v[ri] == M[v[ri]] && v[ri]) val--;
      if (v[ri]) M[v[ri]]--;
      if (v[ri] == M[v[ri]] && v[ri]) val++;
      ri--;
    }
    ans[id] = val;
  }
  for (int i = 1; i <= m; ++i) cout << ans[i] << '\n';
}
