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 sc1() {
  int x;
  scanf("%d", &x);
  return x;
}
long long sc2() {
  long long x;
  scanf("%lld", &x);
  return x;
}
int bs;
int n, q;
int arr[100007];
int cnt[100007];
int ans = 0;
int answer[100007];
struct A {
  int l, r, id;
} node[100007];
bool cmp(A a, A b) {
  int x = a.l / bs;
  int y = b.l / bs;
  if (x != y) return x < y;
  return a.r < b.r;
}
void add(int x) {
  if (x <= n) {
    if (cnt[x] == x) ans--;
    cnt[x]++;
    if (cnt[x] == x) ans++;
  }
}
void rmv(int x) {
  if (x <= n) {
    if (cnt[x] == x) ans--;
    cnt[x]--;
    if (cnt[x] == x) ans++;
  }
}
int main() {
  n = sc1(), q = sc1();
  bs = sqrt(n);
  for (int i = 0; i < n; i++) arr[i] = sc1();
  for (int i = 0; i < q; i++) {
    int a = sc1(), b = sc1();
    node[i].l = --a;
    node[i].r = --b;
    node[i].id = i;
  }
  sort(node, node + q, cmp);
  int mo_left = 0, mo_right = -1;
  for (int i = 0; i < q; i++) {
    int left = node[i].l;
    int right = node[i].r;
    while (mo_right < right) {
      mo_right++;
      add(arr[mo_right]);
    }
    while (mo_right > right) {
      rmv(arr[mo_right]);
      mo_right--;
    }
    while (mo_left < left) {
      rmv(arr[mo_left]);
      mo_left++;
    }
    while (mo_left > left) {
      mo_left--;
      add(arr[mo_left]);
    }
    answer[node[i].id] = ans;
  }
  for (int i = 0; i < q; i++) {
    cout << answer[i] << endl;
  }
  return 0;
}
