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;
long long bsize = 400;
struct query {
  long long left, right;
  long long ind;
} q[100000];
long long ar[100001], qans[100000];
long long mp[100001];
bool compare(query a, query b) {
  if ((a.left) / bsize == (b.left) / bsize) return a.right < b.right;
  return (a.left) / bsize < (b.left) / bsize;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  memset(mp, 0, sizeof mp);
  long long n, m;
  cin >> n >> m;
  for (long long i = 0; i < n; i++) cin >> ar[i];
  for (long long i = 0; i < m; i++) {
    cin >> q[i].left >> q[i].right;
    q[i].ind = i;
    q[i].left -= 1;
    q[i].right -= 1;
  }
  sort(q, q + m, compare);
  long long ans = 0, begin = 0, end = -1;
  for (long long i = 0; i < m; i++) {
    long long aind = q[i].ind, first = q[i].left, last = q[i].right;
    while (end < last) {
      end++;
      long long ele = ar[end];
      if (ele <= 100000) {
        mp[ele]++;
        if (mp[ele] == ele)
          ans++;
        else if (mp[ele] == ele + 1)
          ans--;
      }
    }
    while (end > last) {
      long long ele = ar[end];
      if (ele <= 100000) {
        if (mp[ele] == ele)
          ans--;
        else if (mp[ele] == ele + 1)
          ans++;
        mp[ele]--;
      }
      end--;
    }
    while (begin < first) {
      long long ele = ar[begin];
      if (ele <= 100000) {
        if (mp[ele] == ele)
          ans--;
        else if (mp[ele] == ele + 1)
          ans++;
        mp[ele]--;
      }
      begin++;
    }
    while (begin > first) {
      begin--;
      long long ele = ar[begin];
      if (ele <= 100000) {
        mp[ele]++;
        if (mp[ele] == ele)
          ans++;
        else if (mp[ele] == ele + 1)
          ans--;
      }
    }
    qans[aind] = ans;
  }
  for (long long i = 0; i < m; i++) cout << qans[i] << "\n";
  return 0;
}
