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 bs = 316;
struct query {
  int l, r, id;
} q[100010];
int a[100010], b[100010], buc[100010], out[100010], ans;
inline int read() {
  char c = getchar();
  int x = 0;
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + c - '0';
    c = getchar();
  }
  return x;
}
inline void write(int x) {
  if (!x) {
    putchar('0');
    putchar('\n');
    return;
  }
  int sta[10], tp = 0;
  while (x) {
    sta[++tp] = x % 10;
    x /= 10;
  }
  while (tp) putchar(sta[tp--] + '0');
  putchar('\n');
}
bool cmp(query x, query y) {
  if (x.l / bs != y.l / bs) return x.l < y.l;
  if ((x.l / bs) & 1) return x.r < y.r;
  return x.r > y.r;
}
inline void add(int p) {
  if (b[a[p]] == buc[a[p]]) ans--;
  buc[a[p]]++;
  if (b[a[p]] == buc[a[p]]) ans++;
}
inline void del(int p) {
  if (b[a[p]] == buc[a[p]]) ans--;
  buc[a[p]]--;
  if (b[a[p]] == buc[a[p]]) ans++;
}
int main() {
  int n = read(), m = read(), l, i, L = 1, R = 0;
  for (i = 1; i <= n; i++) b[i] = a[i] = read();
  for (i = 1; i <= m; i++) {
    q[i].l = read();
    q[i].r = read();
    q[i].id = i;
  }
  sort(q + 1, q + m + 1, cmp);
  sort(b + 1, b + n + 1);
  l = unique(b + 1, b + n + 1) - b;
  for (i = 1; i <= n; i++) a[i] = lower_bound(b + 1, b + l, a[i]) - b;
  for (i = 1; i <= m; i++) {
    while (R < q[i].r) add(++R);
    while (R > q[i].r) del(R--);
    while (L > q[i].l) add(--L);
    while (L < q[i].l) del(L++);
    out[q[i].id] = ans;
  }
  for (i = 1; i <= m; i++) write(out[i]);
  return 0;
}
