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 N = 1e5 + 10;
pair<int, int> p[N], tp[N];
map<pair<int, int>, int> ma;
int k;
unordered_map<int, int> fre;
bool cmp(pair<int, int> a, pair<int, int> b) {
  int b1 = a.first / k, b2 = b.first / k;
  if (b1 != b2) return b1 < b2;
  return a.second < b.second;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, i;
  cin >> n >> m;
  int a[n + 10];
  for (i = 0; i <= n - 1; i++) cin >> a[i];
  k = sqrt((long double)n);
  for (i = 0; i <= m - 1; i++) {
    int l, r;
    cin >> l >> r;
    l--;
    r--;
    p[i] = make_pair(l, r);
    tp[i] = p[i];
  }
  sort(p, p + m, cmp);
  int ans = 0, res[m + 10];
  int rptr = 0, lptr = 0;
  fre[a[0]]++;
  if (a[0] == 1) ans++;
  for (i = 0; i <= m - 1; i++) {
    int lt = p[i].first;
    int rt = p[i].second;
    while (rptr < rt) {
      rptr++;
      if (fre[a[rptr]] == a[rptr]) ans--;
      fre[a[rptr]]++;
      if (fre[a[rptr]] == a[rptr]) ans++;
    }
    while (lptr < lt) {
      if (fre[a[lptr]] == a[lptr]) ans--;
      fre[a[lptr]]--;
      if (fre[a[lptr]] == a[lptr]) ans++;
      lptr++;
    }
    while (rptr > rt) {
      if (fre[a[rptr]] == a[rptr]) ans--;
      fre[a[rptr]]--;
      if (fre[a[rptr]] == a[rptr]) ans++;
      rptr--;
    }
    while (lptr > lt) {
      lptr--;
      if (fre[a[lptr]] == a[lptr]) ans--;
      fre[a[lptr]]++;
      if (fre[a[lptr]] == a[lptr]) ans++;
    }
    ma[p[i]] = ans;
  }
  for (i = 0; i <= m - 1; i++) cout << ma[tp[i]] << "\n";
  return 0;
}
