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 long long maxn = 1e5 + 1, k = 300;
struct dt {
  int l, r, st;
};
int a[maxn], dd[maxn], n, q, ans[maxn];
dt ss[maxn];
bool cmp(dt t1, dt t2) {
  return ((t1.l + k - 1) / k) * maxn * 2 + t1.r <
         ((t2.l + k - 1) / k) * maxn * 2 + t2.r;
}
void read() {
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  int l, r;
  for (int i = 1; i <= q; i++) {
    cin >> l >> r;
    ss[i] = {l, r, i};
  }
}
void process() {
  sort(ss + 1, ss + q + 1, cmp);
  int cnt = 0;
  for (int j = ss[1].l; j <= ss[1].r; j++)
    if (a[j] <= n) {
      dd[a[j]]++;
      if (dd[a[j]] == a[j])
        cnt++;
      else if (dd[a[j]] > a[j] && dd[a[j]] - 1 == a[j])
        cnt--;
    }
  ans[ss[1].st] = cnt;
  for (int i = 2; i <= q; i++) {
    for (int j = ss[i - 1].l; j < ss[i].l; j++)
      if (a[j] <= n) {
        dd[a[j]]--;
        if (dd[a[j]] == a[j])
          cnt++;
        else if (dd[a[j]] < a[j] && dd[a[j]] + 1 == a[j])
          cnt--;
      }
    for (int j = ss[i - 1].l - 1; j >= ss[i].l; j--)
      if (a[j] <= n) {
        dd[a[j]]++;
        if (dd[a[j]] == a[j])
          cnt++;
        else if (dd[a[j]] > a[j] && dd[a[j]] - 1 == a[j])
          cnt--;
      }
    for (int j = ss[i - 1].r + 1; j <= ss[i].r; j++)
      if (a[j] <= n) {
        dd[a[j]]++;
        if (dd[a[j]] == a[j])
          cnt++;
        else if (dd[a[j]] > a[j] && dd[a[j]] - 1 == a[j])
          cnt--;
      }
    for (int j = ss[i - 1].r; j > ss[i].r; j--)
      if (a[j] <= n) {
        dd[a[j]]--;
        if (dd[a[j]] == a[j])
          cnt++;
        else if (dd[a[j]] < a[j] && dd[a[j]] + 1 == a[j])
          cnt--;
      }
    ans[ss[i].st] = cnt;
  }
  for (int i = 1; i <= q; i++) cout << ans[i] << endl;
}
int main() {
  read();
  process();
  return 0;
}
