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;
using ll = long long;
using vl = vector<ll>;
const ll INF = 1e18 + 1;
ll bucket_size;
struct Query {
  int idx, l, r;
  Query(int i, int left, int right) {
    idx = i;
    l = left;
    r = right;
  }
  bool operator<(const Query& other) const {
    return make_pair(l / bucket_size, r) <
           make_pair(other.l / bucket_size, other.r);
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ll N, Q;
  cin >> N >> Q;
  vl A(N);
  for (int i = 0; i < N; i++) cin >> A[i];
  vector<Query> queries;
  for (int i = 0; i < Q; i++) {
    ll li, ri;
    cin >> li >> ri;
    queries.push_back(Query(i, li, ri));
  }
  bucket_size = ceil(sqrt(N));
  sort(queries.begin(), queries.end());
  int start = 0;
  int end = -1;
  unordered_map<int, int> freq;
  vector<int> answers(Q);
  int ans = 0;
  for (int i = 0; i < Q; i++) {
    Query q = queries[i];
    q.l--;
    q.r--;
    while (start > q.l) {
      start--;
      if (freq[A[start]] == A[start]) {
        ans--;
      }
      freq[A[start]]++;
      if (A[start] == freq[A[start]]) {
        ans++;
      }
    }
    while (end < q.r) {
      end++;
      if (A[end] == freq[A[end]]) {
        ans--;
      }
      freq[A[end]]++;
      if (A[end] == freq[A[end]]) {
        ans++;
      }
    }
    while (start < q.l) {
      if (freq[A[start]] == A[start]) {
        ans--;
      }
      freq[A[start]]--;
      if (freq[A[start]] == A[start]) {
        ans++;
      }
      start++;
    }
    while (end > q.r) {
      if (freq[A[end]] == A[end]) {
        ans--;
      }
      freq[A[end]]--;
      if (freq[A[end]] == A[end]) {
        ans++;
      }
      end--;
    }
    answers[q.idx] = ans;
  }
  for (int i = 0; i < Q; i++) {
    cout << answers[i] << endl;
  }
}
