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 inf = 0x3f3f3f3f;
const int minf = -inf;
const int di[] = {1, -1, 0, 0};
const int dj[] = {0, 0, 1, -1};
const int Q = 1000;
int v[211111], cnt[1111111], id[211111];
int res;
struct Query {
  int l, r, id;
  Query() {}
  Query(int l, int r, int id) : l(l), r(r), id(id) {}
  bool operator<(const Query &q) const {
    if (l / Q == q.l / Q) return r > q.r;
    return l / Q < q.l / Q;
  }
};
map<int, int> mapa;
void add(int p) {
  int c = v[p];
  int idc = id[p];
  ++cnt[idc];
  if (cnt[idc] == c)
    res++;
  else if (cnt[idc] == c + 1)
    res--;
}
void rem(int p) {
  int c = v[p];
  int idc = id[p];
  --cnt[idc];
  if (cnt[idc] == c)
    res++;
  else if (cnt[idc] == c - 1)
    res--;
}
Query que[111111];
int ans[111111];
int main() {
  int n, t;
  scanf("%d%d", &n, &t);
  int aux = 0;
  for (int(i) = (0); (i) < (n); ++(i)) {
    scanf("%d", &v[i]);
    if (mapa.count(v[i]) == 0) mapa[v[i]] = aux++;
    id[i] = mapa[v[i]];
  }
  for (int(i) = (0); (i) < (t); ++(i)) {
    scanf("%d%d", &que[i].l, &que[i].r);
    que[i].l--;
    que[i].id = i;
  }
  sort(que, que + t);
  int l = 0, r = 0;
  res = 0;
  for (int(i) = (0); (i) < (t); ++(i)) {
    Query q = que[i];
    while (r < q.r) {
      add(r++);
    }
    while (l > q.l) {
      add(--l);
    }
    while (r > q.r) {
      rem(--r);
    }
    while (l < q.l) {
      rem(l++);
    }
    ans[q.id] = res;
  }
  for (int(i) = (0); (i) < (t); ++(i)) printf("%d\n", ans[i]);
}
