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>
#pragma comment(linker, "/STACK:100000000")
using namespace std;
int b[500][100005], c[500];
int main() {
  srand(time(0));
  int n, m, i, j, k;
  scanf("%d %d", &n, &m);
  map<int, vector<int> > a;
  for (i = 0; i < n; i++) {
    scanf("%d", &k);
    if (k <= n) a[k].push_back(i + 1);
  }
  vector<int> v;
  map<int, vector<int> >::iterator it;
  for (it = a.begin(); it != a.end(); it++)
    if (it->first > it->second.size()) v.push_back(it->first);
  for (i = 0; i < v.size(); i++) a.erase(v[i]);
  k = 0;
  for (it = a.begin(); it != a.end(); it++) {
    c[k] = it->first;
    for (i = 0; i < it->second.size(); i++) b[k][it->second[i]] = 1;
    for (i = 1; i <= n; i++) b[k][i] += b[k][i - 1];
    k++;
  }
  while (m--) {
    scanf("%d %d", &i, &j);
    int cnt = 0;
    for (n = 0; n < k; n++)
      if (c[n] == b[n][j] - b[n][i - 1]) cnt++;
    printf("%d\n", cnt);
  }
  return 0;
}
