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 + 1;
const long long int inf = 1e18;
long long int a[N], sz = 330, ans[N], cnt, n;
long long int h[N];
struct st {
  int l, r, i;
} q[N];
bool cmp(st& x, st& y) {
  if ((x.l / sz) != (y.l / sz)) return (x.l / sz) < (y.l / sz);
  return x.r < y.r;
}
void remo(long long int pos) {
  if (a[pos] > n) return;
  h[a[pos]]--;
  if (h[a[pos]] == a[pos] - 1) cnt--;
  if (h[a[pos]] == a[pos]) cnt++;
}
void add(long long int pos) {
  if (a[pos] > n) return;
  h[a[pos]]++;
  if (h[a[pos]] == a[pos] + 1) cnt--;
  if (h[a[pos]] == a[pos]) cnt++;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int m, lll, rrr;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].l--;
    q[i].r--;
    q[i].i = i;
  }
  sort(q, q + m, cmp);
  long long int cur_l = 0, cur_r = 0;
  for (int i = 0; i < m; i++) {
    lll = q[i].l, rrr = q[i].r;
    while (cur_l < lll) {
      remo(cur_l);
      cur_l++;
    }
    while (cur_l > lll) {
      add(cur_l - 1);
      cur_l--;
    }
    while (cur_r <= rrr) {
      add(cur_r);
      cur_r++;
    }
    while (cur_r > rrr + 1) {
      remo(cur_r - 1);
      cur_r--;
    }
    ans[q[i].i] = cnt;
  }
  for (int i = 0; i < m; i++) cout << ans[i] << "\n";
  return 0;
}
