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;
long long int block;
long long int n, m, a[100005];
long long int ans[100005];
struct Query {
  long long int L, R, pos;
};
Query q[100005];
bool compare(Query x, Query y) {
  if (x.L / block != y.L / block) return x.L / block < y.L / block;
  return x.R < y.R;
}
void queryResults() {
  block = (long long int)sqrt(n);
  sort(q, q + m, compare);
  int currL = 0, currR = 0;
  int count = 0;
  long long int first[100005] = {0};
  for (int i = 0; i < m; i++) {
    int L = q[i].L, R = q[i].R;
    bool b[100005] = {0};
    while (currL < L) {
      if (a[currL] <= 100000) {
        if (first[a[currL]] == a[currL] && (b[a[currL]] == 0)) {
          count--;
          b[a[currL]] = 1;
        }
        first[a[currL]]--;
        if (first[a[currL]] == a[currL]) count++;
      }
      currL++;
    }
    while (currL > L) {
      if (a[currL - 1] <= 100000) {
        if (first[a[currL - 1]] == a[currL - 1] && (b[a[currL - 1]] == 0)) {
          count--;
          b[a[currL - 1]] = 1;
        }
        first[a[currL - 1]]++;
        if (first[a[currL - 1]] == a[currL - 1]) count++;
      }
      currL--;
    }
    while (currR <= R) {
      if (a[currR] <= 100000) {
        if (first[a[currR]] == a[currR] && (b[a[currR]] == 0)) {
          count--;
          b[a[currR]] = 1;
        }
        first[a[currR]]++;
        if (first[a[currR]] == a[currR]) count++;
      }
      currR++;
    }
    while (currR > R + 1) {
      if (a[currR - 1] <= 100000) {
        if (first[a[currR - 1]] == a[currR - 1] && (b[a[currR - 1]] == 0)) {
          count--;
          b[a[currR - 1]] = 1;
        }
        first[a[currR - 1]]--;
        if (first[a[currR - 1]] == a[currR - 1]) count++;
      }
      currR--;
    }
    ans[q[i].pos] = count;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int i, x, y;
  cin >> n >> m;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < m; i++) {
    cin >> x >> y;
    q[i].L = (x - 1);
    q[i].R = (y - 1);
    q[i].pos = i;
  }
  queryResults();
  for (i = 0; i < m; i++) cout << ans[i] << '\n';
  return 0;
}
