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 maxm = 1e6 + 9;
const int maxn = 1e5 + 9;
const int N = 25000;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int base = 131;
const double eps = 1e-4;
int n, q, a[maxn];
struct QUE {
  int l, r, id;
} que[maxn];
int S, BL[maxn];
int cnt[maxn], ans[maxn], res;
int read() {
  int a = 1, b = 0;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') a = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    b = (b << 1) + (b << 3) + (c ^ '0');
    c = getchar();
  }
  return a * b;
}
void print(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) print(x / 10);
  putchar(x % 10 + '0');
}
inline bool cmp(QUE a, QUE b) {
  return BL[a.l] == BL[b.l] ? a.r < b.r : a.l < b.l;
}
void add(int val) {
  if (val == -1) return;
  if (cnt[val] == val) res--;
  cnt[val]++;
  if (cnt[val] == val) res++;
}
void del(int val) {
  if (val == -1) return;
  if (cnt[val] == val) res--;
  cnt[val]--;
  if (cnt[val] == val) res++;
}
int main() {
  int x;
  n = read(), q = read();
  S = sqrt(n);
  for (register int i = (1); i <= (n); ++i)
    x = read(), a[i] = x > n ? -1 : x, BL[i] = (i - 1) / S + 1;
  for (register int i = (1); i <= (q); ++i) {
    que[i].l = read();
    que[i].r = read();
    que[i].id = i;
  }
  sort(que + 1, que + 1 + q, cmp);
  int lit = que[1].l, rit = lit - 1;
  for (register int i = (1); i <= (q); ++i) {
    while (lit > que[i].l) add(a[--lit]);
    while (rit < que[i].r) add(a[++rit]);
    while (lit < que[i].l) del(a[lit++]);
    while (rit > que[i].r) del(a[rit--]);
    ans[que[i].id] = res;
  }
  for (register int i = (1); i <= (q); ++i) print(ans[i]), putchar('\n');
  return 0;
}
