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 MAXN = 1e6 + 5;
int inline read() {
  int x = 0, f = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') f ^= (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar();
  return f ? -x : x;
}
int n, q, a[MAXN], b[MAXN];
pair<int, int> fuck[MAXN];
struct query {
  int l, r, id;
  bool operator<(const query& A) const {
    return ((l - 1) / 1000 + 1) == ((A.l - 1) / 1000 + 1) ? r < A.r : l > A.l;
  }
} qq[MAXN];
int ans[MAXN];
int cnt[MAXN], pl = 1, pr = 0, pans = 0;
void add(int pos) {
  ++cnt[a[pos]];
  if (cnt[a[pos]] == b[pos])
    ++pans;
  else if (cnt[a[pos]] == b[pos] + 1)
    --pans;
}
void del(int pos) {
  if (cnt[a[pos]] == b[pos])
    --pans;
  else if (cnt[a[pos]] == b[pos] + 1)
    ++pans;
  --cnt[a[pos]];
}
int main() {
  n = read();
  q = read();
  for (int i = 1; i <= n; ++i)
    fuck[i].first = b[i] = read(), fuck[i].second = i;
  sort(fuck + 1, fuck + n + 1);
  for (int i = 1, last = -1, p = 0; i <= n; ++i) {
    if (last != fuck[i].first) ++p, last = fuck[i].first;
    a[fuck[i].second] = p;
  }
  for (int i = 1; i <= q; ++i) qq[i].l = read(), qq[i].r = read(), qq[i].id = i;
  sort(qq + 1, qq + q + 1);
  for (int i = 1; i <= q; ++i) {
    while (pl > qq[i].l) add(--pl);
    while (pr < qq[i].r) add(++pr);
    while (pl < qq[i].l) del(pl++);
    while (pr > qq[i].r) del(pr--);
    ans[qq[i].id] = pans;
  }
  for (int i = 1; i <= q; ++i) printf("%d\n", ans[i]);
}
