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>
const int INF = 0x3f3f3f3f;
const int SIZE = 1000 + 10;
using namespace std;
int num[100010];
int f[100010];
int cnt[100010];
int L = 1, R = 0, tot = 0;
struct question {
  int id;
  int l;
  int r;
} q[100010];
int ans[100010];
bool cmp(question a, question b) {
  if (f[a.l] != f[b.l]) return f[a.l] < f[b.l];
  return a.r < b.r;
}
void add(int i) {
  if (num[i] >= 100010) return;
  if (cnt[num[i]] == num[i]) tot--;
  cnt[num[i]]++;
  if (cnt[num[i]] == num[i]) tot++;
}
void del(int i) {
  if (num[i] >= 100010) return;
  if (cnt[num[i]] == num[i]) tot--;
  cnt[num[i]]--;
  if (cnt[num[i]] == num[i]) tot++;
}
int main(void) {
  memset(cnt, 0, sizeof(cnt));
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= ceil(n * 1.0 / sqrt(n)); i++) {
    for (int j = (i - 1) * sqrt(n) + 1; j <= i * sqrt(n) && j <= n; j++) {
      f[j] = i;
    }
  }
  for (int i = 1; i <= n; i++) scanf("%d", &num[i]);
  for (int i = 1; i <= m; i++) {
    scanf("%d %d", &q[i].l, &q[i].r);
    q[i].id = i;
  }
  sort(q + 1, q + m + 1, cmp);
  for (int i = 1; i <= m; i++) {
    while (L < q[i].l) {
      del(L++);
    }
    while (L > q[i].l) {
      add(--L);
    }
    while (R < q[i].r) {
      add(++R);
    }
    while (R > q[i].r) {
      del(R--);
    }
    ans[q[i].id] = tot;
  }
  for (int i = 1; i <= m; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
