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;
int fx[] = {1, -1, 0, 0};
int fy[] = {0, 0, 1, -1};
int N, Q, seg = 1000, cur_L, cur_R;
long long ans;
long long cell[100005];
unordered_map<int, int> cnt;
long long answer[100005];
struct data {
  int lf, rt, id;
  data() {}
  data(int a, int b, int c) {
    lf = a;
    rt = b;
    id = c;
  }
  bool operator<(const data &yoo) const {
    return lf / seg == yoo.lf / seg ? rt < yoo.rt : lf / seg < yoo.lf / seg;
  }
} MO[200007];
inline void add(int i) {
  if (cnt[cell[i]] == cell[i]) ans--;
  cnt[cell[i]]++;
  if (cnt[cell[i]] == cell[i]) ans++;
}
inline void del(int i) {
  if (cnt[cell[i]] == cell[i]) ans--;
  cnt[cell[i]]--;
  if (cnt[cell[i]] == cell[i]) ans++;
}
void call_mo(int i) {
  int LF = MO[i].lf;
  int RT = MO[i].rt;
  while (LF != cur_L) {
    if (cur_L < LF)
      del(cur_L++);
    else
      add(--cur_L);
  }
  while (RT != cur_R) {
    if (cur_R > RT)
      del(cur_R--);
    else
      add(++cur_R);
  }
  answer[MO[i].id] = ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> Q;
  for (int i = 1; i <= N; i++) cin >> cell[i];
  for (int i = 1; i <= Q; i++) {
    long long l, r;
    cin >> l >> r;
    MO[i - 1] = data(l, r, i);
  }
  sort(MO, MO + Q);
  cur_L = MO[0].lf;
  cur_R = MO[0].rt;
  for (int i = cur_L; i <= cur_R; i++) {
    add(i);
  }
  answer[MO[0].id] = ans;
  for (int i = 1; i <= Q - 1; i++) call_mo(i);
  for (int i = 1; i <= Q; i++) cout << answer[i] << '\n';
  return 0;
}
