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 N = 1e5 + 5;
int va[N];
int n, m, block;
int ans[N];
int vis[N];
struct node {
  int l, r, id;
};
node z[N];
bool cmp(node a, node b) {
  if ((a.l - 1) / block == (b.l - 1) / block) return a.r < b.r;
  return (a.l - 1) / block < (b.l - 1) / block;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  block = sqrt(n);
  for (int i = 1; i <= n; i++) cin >> va[i];
  for (int i = 1; i <= m; i++) {
    cin >> z[i].l >> z[i].r;
    z[i].id = i;
  }
  sort(z + 1, z + m + 1, cmp);
  int l = 1, r = 0, sum = 0;
  for (int i = 1; i <= m; i++) {
    while (z[i].r > r) {
      if (va[++r] > 1e5) continue;
      vis[va[r]]++;
      if (vis[va[r]] == va[r])
        sum++;
      else if (vis[va[r]] - 1 == va[r])
        sum--;
    }
    while (z[i].r < r) {
      if (va[r] > 1e5) {
        r--;
        continue;
      }
      vis[va[r]]--;
      if (vis[va[r]] == va[r])
        sum++;
      else if (vis[va[r]] + 1 == va[r])
        sum--;
      r--;
    }
    while (z[i].l > l) {
      if (va[l] > 1e5) {
        l++;
        continue;
      }
      vis[va[l]]--;
      if (vis[va[l]] == va[l])
        sum++;
      else if (vis[va[l]] + 1 == va[l])
        sum--;
      l++;
    }
    while (z[i].l < l) {
      if (va[--l] > 1e5) continue;
      vis[va[l]]++;
      if (vis[va[l]] == va[l])
        sum++;
      else if (vis[va[l]] - 1 == va[l])
        sum--;
    }
    ans[z[i].id] = sum;
  }
  for (int i = 1; i <= m; i++) cout << ans[i] << endl;
}
