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 a[100001], ans[100001];
int n, m, s;
vector<pair<pair<int, int>, int> > z;
unordered_map<int, int> b;
bool cmp(const pair<pair<int, int>, int>& l,
         const pair<pair<int, int>, int>& r) {
  if (l.first.first / s == r.first.first / s) {
    return l.first.second < r.first.second;
  }
  return l.first.first / s < r.first.first / s;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  s = sqrt(m) + 1;
  ;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  z.resize(m);
  for (int i = 0; i < m; i++) {
    int l, r;
    cin >> l >> r;
    z[i] = {{l - 1, r - 1}, i};
  }
  sort(z.begin(), z.end(), cmp);
  int res = 0;
  int prl = 0, prr = -1;
  for (int i = 0; i < m; i++) {
    int l = z[i].first.first, r = z[i].first.second, p = z[i].second;
    while (r < prr) {
      if (a[prr] == b[a[prr]]) res--;
      b[a[prr]]--;
      if (a[prr] == b[a[prr]]) res++;
      prr--;
    }
    while (prr < r) {
      prr++;
      if (a[prr] == b[a[prr]]) res--;
      b[a[prr]]++;
      if (a[prr] == b[a[prr]]) res++;
    }
    while (prl < l) {
      if (a[prl] == b[a[prl]]) res--;
      b[a[prl]]--;
      if (a[prl] == b[a[prl]]) res++;
      prl++;
    }
    while (l < prl) {
      prl--;
      if (a[prl] == b[a[prl]]) res--;
      b[a[prl]]++;
      if (a[prl] == b[a[prl]]) res++;
    }
    ans[p] = res;
  }
  for (int i = 0; i < m; i++) cout << ans[i] << "\n";
}
