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 = 100009;
const int SQRT = 420;
struct Q {
  int l, r;
  int ind;
} q[maxn];
bool operator<(Q a, Q b) {
  if (a.l / SQRT == b.l / SQRT) return a.r < b.r;
  return a.l < b.l;
}
int a[maxn];
int ans[maxn];
int cnt[maxn];
int tmpans;
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    if (a[i] > n) a[i] = n + 1;
  }
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &q[i].l, &q[i].r);
    q[i].ind = i;
  }
  sort(q, q + m);
  int l = 1, r = 1;
  for (int i = 0; i < m; i++) {
    while (l < q[i].l) {
      if (cnt[a[l]] == a[l]) tmpans--;
      cnt[a[l]]--;
      if (cnt[a[l]] == a[l]) tmpans++;
      l++;
    }
    while (l > q[i].l) {
      l--;
      if (cnt[a[l]] == a[l]) tmpans--;
      cnt[a[l]]++;
      if (cnt[a[l]] == a[l]) tmpans++;
    }
    while (r < q[i].r + 1) {
      if (cnt[a[r]] == a[r]) tmpans--;
      cnt[a[r]]++;
      if (cnt[a[r]] == a[r]) tmpans++;
      r++;
    }
    while (r > q[i].r + 1) {
      r--;
      if (cnt[a[r]] == a[r]) tmpans--;
      cnt[a[r]]--;
      if (cnt[a[r]] == a[r]) tmpans++;
    }
    ans[q[i].ind] = tmpans;
  }
  for (int i = 0; i < m; i++) cout << ans[i] << endl;
}
