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;
struct Query {
  long long i, a, b;
};
long long M[100005];
long long w;
Query Q[100005];
long long R[100005];
long long A[100005];
bool comp(Query q1, Query q2) {
  long long b1 = q1.a / w;
  long long b2 = q2.a / w;
  if (b1 != b2) {
    return b1 < b2;
  } else {
    return q1.b < q2.b;
  }
}
int main() {
  long long n, m;
  cin >> n >> m;
  w = sqrt(n);
  for (long long i = 0; i < n; i++) {
    cin >> M[i];
  }
  for (long long i = 0; i < m; i++) {
    Q[i].i = i;
    cin >> Q[i].a >> Q[i].b;
    Q[i].a--;
    Q[i].b--;
  }
  sort(Q, Q + m, comp);
  long long a = 0, b = -1;
  long long r = 0;
  for (long long i = 0; i < m; i++) {
    while (a < Q[i].a) {
      if (M[a] <= n) {
        if (A[M[a]] == M[a]) r--;
        A[M[a]]--;
        if (A[M[a]] == M[a]) r++;
      }
      a++;
    }
    while (a > Q[i].a) {
      a--;
      if (M[a] <= n) {
        if (A[M[a]] == M[a]) r--;
        A[M[a]]++;
        if (A[M[a]] == M[a]) r++;
      }
    }
    while (b < Q[i].b) {
      b++;
      if (M[b] <= n) {
        if (A[M[b]] == M[b]) r--;
        A[M[b]]++;
        if (A[M[b]] == M[b]) r++;
      }
    }
    while (b > Q[i].b) {
      if (M[b] <= n) {
        if (A[M[b]] == M[b]) r--;
        A[M[b]]--;
        if (A[M[b]] == M[b]) r++;
      }
      b--;
    }
    R[Q[i].i] = r;
  }
  for (long long i = 0; i < m; i++) {
    cout << R[i] << "\n";
  }
}
