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;
void go() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
int B, ans = 0;
vector<int> a;
vector<int> cnt(1e5 + 5);
struct Query {
  int l, r, i;
};
bool cmp(Query a, Query b) {
  if (a.l / B != b.l / B) return a.l < b.l;
  return a.r < b.r;
}
void add(int index) {
  if (a[index] <= cnt.size()) {
    cnt[a[index]]++;
    if (cnt[a[index]] == a[index]) ans++;
    if (cnt[a[index]] == a[index] + 1) ans--;
  }
}
void rem(int index) {
  if (a[index] <= cnt.size()) {
    cnt[a[index]]--;
    if (cnt[a[index]] == a[index]) ans++;
    if (cnt[a[index]] == a[index] - 1) ans--;
  }
}
signed main() {
  go();
  int n, q;
  cin >> n >> q;
  a.resize(n);
  B = sqrt(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  Query Q[q];
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    Q[i].l = l;
    Q[i].r = r;
    Q[i].i = i;
  }
  sort(Q, Q + q, cmp);
  int cL = 0, cR = -1;
  vector<int> res(q);
  for (int i = 0; i < q; i++) {
    int L = Q[i].l;
    int R = Q[i].r;
    int I = Q[i].i;
    while (cR < R) ++cR, add(cR);
    while (cL < L) rem(cL), ++cL;
    while (cL > L) --cL, add(cL);
    while (cR > R) rem(cR), --cR;
    res[I] = ans;
  }
  for (int i = 0; i < q; i++) {
    cout << res[i] << '\n';
  }
}
