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 Int() {
  int x;
  scanf("%d", &x);
  return x;
}
long long Long() {
  long long x;
  scanf("%lld", &x);
  return x;
}
double Double() {
  double x;
  scanf("%lf", &x);
  return x;
}
float Float() {
  float x;
  scanf("%f", &x);
  return x;
}
const int N = 1e5 + 5;
int blocks;
int answer[N];
int val[N];
int arr[N];
int ans;
struct MO {
  int l;
  int r;
  int index;
  bool operator<(const MO &another) const {
    if (l / blocks != another.l / blocks)
      return l / blocks < another.l / blocks;
    return r / blocks < another.r / blocks;
  }
} q[N];
void add(int position) {
  val[arr[position]]++;
  if (val[arr[position]] == arr[position]) ans++;
  if (val[arr[position]] == arr[position] + 1) ans--;
}
void del(int position) {
  if (val[arr[position]] == arr[position] + 1) ans++;
  if (val[arr[position]] == arr[position]) ans--;
  val[arr[position]]--;
}
int main() {
  int n = Int(), m = Int();
  for (int i = 0; i < n; i++) {
    arr[i + 1] = Int();
    if (arr[i + 1] > n) arr[i + 1] = n + 1;
  }
  for (int i = 0; i < m; i++) {
    int l = Int(), r = Int();
    q[i].l = l, q[i].r = r, q[i].index = i;
  }
  blocks = (int)sqrt(n) << 1;
  sort(q, q + m);
  int currentL = 0, currentR = 0;
  for (int i = 0; i < m; i++) {
    while (currentL < q[i].l) {
      del(currentL);
      currentL++;
    }
    while (currentL > q[i].l) {
      add(currentL - 1);
      currentL--;
    }
    while (currentR <= q[i].r) {
      add(currentR);
      currentR++;
    }
    while (currentR > q[i].r + 1) {
      del(currentR - 1);
      currentR--;
    }
    answer[q[i].index] = ans;
  }
  for (int i = 0; i < m; i++) {
    cout << answer[i] << "\n";
  }
  return 0;
}
