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;
inline int mod(int n) { return (n % 1000000007); }
int cnt[112345] = {0};
int v[112345];
int n, m;
struct query {
  int id, l, r, ans;
  bool operator<(const query& b) const {
    return l / (int)sqrt(n) < b.l / (int)sqrt(n) ||
           l / (int)sqrt(n) == b.l / (int)sqrt(n) && r < b.r;
  }
};
struct SqrtDecomposition {
  vector<query> q;
  void read(int sz) {
    q.resize(sz);
    for (int i = 0; i < q.size(); i++) {
      q[i].id = i;
      scanf("%d%d", &q[i].l, &q[i].r);
      q[i].l--;
      q[i].r--;
    }
  }
  int curr = 0;
  void add(int idx) {
    if (v[idx] > 100000) return;
    if (cnt[v[idx]] == v[idx]) curr--;
    cnt[v[idx]]++;
    if (cnt[v[idx]] == v[idx]) curr++;
  }
  void remove(int idx) {
    if (v[idx] > 100000) return;
    if (cnt[v[idx]] == v[idx]) curr--;
    cnt[v[idx]]--;
    if (cnt[v[idx]] == v[idx]) curr++;
  }
  int answer_query() { return curr; }
  void calculate() {
    sort(q.begin(), q.end());
    int l = 0, r = -1;
    for (int i = 0; i < q.size(); i++) {
      while (q[i].l < l) add(--l);
      while (r < q[i].r) add(++r);
      while (q[i].l > l) remove(l++);
      while (r > q[i].r) remove(r--);
      q[i].ans = answer_query();
    }
  }
  void print_ans() {
    sort(q.begin(), q.end(),
         [](const query& a, const query& b) { return a.id < b.id; });
    for (query x : q) {
      printf("%d\n", x.ans);
    }
  }
};
int main() {
  scanf("%d%d", &n, &m);
  SqrtDecomposition mos;
  for (int i = 0; i < n; i++) {
    scanf("%d", &v[i]);
  }
  mos.read(m);
  mos.calculate();
  mos.print_ans();
}
