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 B = sqrt(1e5);
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / B != b.first.first / B)
    return a.first.first < b.first.first;
  return (a.first.first / B & 1) ? (a.first.second < b.first.second)
                                 : (a.first.second > b.first.second);
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<int> a(n), fre(n + 1, 0), ans(m);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i] > n) a[i] = 0;
  }
  vector<pair<pair<int, int>, int> > q(m);
  for (int i = 0; i < m; ++i) {
    cin >> q[i].first.first >> q[i].first.second;
    q[i].second = i;
  }
  sort(q.begin(), q.end(), cmp);
  int cur = 0, l = q[0].first.first - 1, r = l - 1;
  for (int i = 0; i < m; ++i) {
    int ll = q[i].first.first, rr = q[i].first.second, idx = q[i].second;
    --ll, --rr;
    while (l < ll) {
      if (fre[a[l]] == a[l] && a[l]) cur--;
      fre[a[l]]--;
      if (fre[a[l]] == a[l] && a[l]) cur++;
      l++;
    }
    while (r < rr) {
      ++r;
      if (fre[a[r]] == a[r] && a[r]) cur--;
      fre[a[r]]++;
      if (fre[a[r]] == a[r] && a[r]) cur++;
    }
    while (l > ll) {
      --l;
      if (fre[a[l]] == a[l] && a[l]) cur--;
      fre[a[l]]++;
      if (fre[a[l]] == a[l] && a[l]) cur++;
    }
    while (r > rr) {
      if (fre[a[r]] == a[r] && a[r]) cur--;
      fre[a[r]]--;
      if (fre[a[r]] == a[r] && a[r]) cur++;
      r--;
    }
    ans[idx] = cur;
  }
  for (auto i : ans) cout << i << '\n';
}
