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 query {
  int l, r, idx;
  long long ans;
} q[100005];
int n, m, x;
long long arr[100005], p[100005];
bool comp(query a, query b) {
  if ((a.l / x) == (b.l) / x) return a.r < b.r;
  return ((a.l) / x < (b.l) / x);
}
bool comp1(query a, query b) { return a.idx < b.idx; }
int main() {
  cin >> n >> m;
  x = sqrt(n);
  for (int i = 0; i < n; i++) scanf("%I64d", &arr[i]);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &q[i].l, &q[i].r);
    q[i].l--;
    q[i].r--;
    q[i].idx = i;
  }
  sort(q, q + m, comp);
  long long a = 0, b = 0, net = 0;
  for (int i = 0; i < m; i++) {
    while (a < q[i].l) {
      if (arr[a] < 100005) {
        p[arr[a]]--;
        if (p[arr[a]] == arr[a])
          net++;
        else if (p[arr[a]] == arr[a] - 1)
          net--;
      }
      a++;
    }
    while (a > q[i].l) {
      if (arr[a - 1] < 100005) {
        p[arr[a - 1]]++;
        if (p[arr[a - 1]] == arr[a - 1])
          net++;
        else if (p[arr[a - 1]] == arr[a - 1] + 1)
          net--;
      }
      a--;
    }
    while (b <= q[i].r) {
      if (arr[b] < 100005) {
        p[arr[b]]++;
        if (p[arr[b]] == arr[b])
          net++;
        else if (p[arr[b]] == arr[b] + 1)
          net--;
      }
      b++;
    }
    while (b > q[i].r + 1) {
      if (arr[b - 1] < 100005) {
        p[arr[b - 1]]--;
        if (p[arr[b - 1]] == arr[b - 1])
          net++;
        else if (p[arr[b - 1]] == arr[b - 1] - 1)
          net--;
      }
      b--;
    }
    q[i].ans = net;
  }
  sort(q, q + m, comp1);
  for (int i = 0; i < m; i++) printf("%I64d\n", q[i].ans);
  return 0;
}
