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;
int main() {
  int n, m, a[110000], b[110000];
  int t = 0, x[110000], l[110000];
  int ll[110000], rr[110000], ans[110000];
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    b[i] = a[i];
  }
  for (int i = 0; i < m; ++i) {
    cin >> ll[i] >> rr[i];
    ans[i] = 0;
  }
  sort(b, b + n);
  int j = 0;
  for (int i = 1; i <= n; ++i) {
    int num = 0;
    while (j < n && b[j] == i) {
      num++;
      j++;
    }
    if (num >= i) x[t++] = i;
  }
  for (int i = 0; i < t; ++i) {
    int xx = x[i];
    l[0] = 0;
    if (a[0] == xx) l[0]++;
    for (int j = 1; j < n; ++j) {
      l[j] = l[j - 1];
      if (a[j] == xx) l[j]++;
    }
    for (int j = 0; j < m; ++j) {
      int cur = l[rr[j] - 1];
      if (ll[j] > 1) cur -= l[ll[j] - 2];
      if (cur == xx) ans[j]++;
    }
  }
  for (int i = 0; i < m; ++i) cout << ans[i] << endl;
  return 0;
}
