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;
const int NMAX = 1e5 + 5, VMAX = 1e6 + 5, DIM = 317;
int N, Q, A[NMAX], Ap[VMAX];
int ans[NMAX];
struct Query {
  int Left, Right, Id;
};
vector<Query> V[DIM + 5];
static inline int Find(int pos) { return (pos + DIM - 1) / DIM; }
static inline void Read() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> N >> Q;
  for (int i = 1; i <= N; ++i) cin >> A[i];
  for (int i = 1; i <= Q; ++i) {
    Query X;
    cin >> X.Left >> X.Right;
    X.Id = i;
    V[Find(X.Left)].push_back(X);
  }
  return;
}
static inline bool cmp(Query A, Query B) { return A.Right < B.Right; }
static inline void Sort() {
  for (int i = 1; i <= DIM + 1; ++i)
    if (!V[i].empty()) sort(V[i].begin(), V[i].end(), cmp);
  return;
}
static inline void Solve() {
  for (int i = 1; i <= DIM + 1; ++i)
    if (!V[i].empty()) {
      int Up_Limit = i * DIM;
      int r = Up_Limit;
      int cnt = 0;
      for (auto it : V[i]) {
        int Left = it.Left;
        int Right = it.Right;
        for (int j = Left; j <= min(Up_Limit, Right); ++j) {
          if (A[j] > N) continue;
          if (Ap[A[j]] == A[j]) --cnt;
          ++Ap[A[j]];
          if (Ap[A[j]] == A[j]) ++cnt;
        }
        for (int j = r + 1; j <= Right; ++j) {
          if (A[j] > N) continue;
          if (Ap[A[j]] == A[j]) --cnt;
          ++Ap[A[j]];
          if (Ap[A[j]] == A[j]) ++cnt;
        }
        ans[it.Id] = cnt;
        for (int j = Left; j <= min(Up_Limit, Right); ++j) {
          if (A[j] > N) continue;
          if (Ap[A[j]] == A[j]) --cnt;
          --Ap[A[j]];
          if (Ap[A[j]] == A[j]) ++cnt;
        }
        r = max(r, Right);
      }
      for (int j = Up_Limit + 1; j <= r; ++j) {
        if (A[j] > N) continue;
        if (Ap[A[j]] == A[j]) --cnt;
        --Ap[A[j]];
        if (Ap[A[j]] == A[j]) ++cnt;
      }
    }
  return;
}
static inline void Write() {
  for (int i = 1; i <= Q; ++i) cout << ans[i] << '\n';
  return;
}
int main() {
  Read();
  Sort();
  Solve();
  Write();
  return 0;
}
