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;
struct node {
  int l;
  int r;
  int id;
} p[100100];
int ans[100100];
int a[100100];
int cnt[100100];
int n, m, temp;
bool cmp(node a, node b) {
  if (a.l == b.l)
    return a.r < b.r;
  else
    return a.l < b.l;
}
void del(int pos) {
  if (a[pos] != 0) {
    cnt[a[pos]]--;
    if (cnt[a[pos]] == a[pos] - 1) temp--;
    if (cnt[a[pos]] == a[pos]) temp++;
  }
}
void add(int pos) {
  if (a[pos] != 0) {
    cnt[a[pos]]++;
    if (cnt[a[pos]] == a[pos]) {
      temp++;
    }
    if (cnt[a[pos]] == a[pos] + 1) temp--;
  }
}
int main() {
  scanf("%d %d", &n, &m);
  int k = 0;
  memset(a, 0, sizeof(a));
  for (int i = 1; i <= n; i++) {
    int num;
    scanf("%d", &num);
    if (num <= 100000) a[i] = num;
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d %d", &p[i].l, &p[i].r);
    p[i].id = i;
  }
  sort(p + 1, p + 1 + m, cmp);
  int left = 1;
  int right = 0;
  temp = 0;
  for (int i = 1; i <= m; i++) {
    while (left < p[i].l) del(left++);
    while (left > p[i].l) add(--left);
    while (right > p[i].r) del(right--);
    while (right < p[i].r) add(++right);
    ans[p[i].id] = temp;
  }
  for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
}
