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 + 10, K = 300;
struct query {
  int l, r, ind;
};
bool cmp(query a, query b) {
  if (a.l / K != b.l / K)
    return (a.l / K < b.l / K);
  else
    return (a.r < b.r);
}
int poj[N], sol[N], arr[N];
query qs[N];
int prijelaz(pair<int, int> a, pair<int, int> b, int t) {
  if (a.first < b.first) {
    for (int i = a.first; i < b.first; i++) {
      if (arr[i] > 100000) continue;
      if (poj[arr[i]] == arr[i]) t--;
      poj[arr[i]]--;
      if (poj[arr[i]] == arr[i]) t++;
    }
  } else {
    for (int i = b.first; i < a.first; i++) {
      if (arr[i] > 100000) continue;
      if (poj[arr[i]] == arr[i]) t--;
      poj[arr[i]]++;
      if (poj[arr[i]] == arr[i]) t++;
    }
  }
  if (a.second < b.second) {
    for (int i = a.second + 1; i <= b.second; i++) {
      if (arr[i] > 100000) continue;
      if (poj[arr[i]] == arr[i]) t--;
      poj[arr[i]]++;
      if (poj[arr[i]] == arr[i]) t++;
    }
  } else {
    for (int i = b.second + 1; i <= a.second; i++) {
      if (arr[i] > 100000) continue;
      if (poj[arr[i]] == arr[i]) t--;
      poj[arr[i]]--;
      if (poj[arr[i]] == arr[i]) t++;
    }
  }
  return t;
}
int main() {
  ios::sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> qs[i].l >> qs[i].r;
    qs[i].ind = i;
  }
  sort(qs, qs + m, cmp);
  int temp = 0;
  pair<int, int> lst = make_pair(1, 0);
  temp = 0;
  for (int i = 0; i < m; i++) {
    pair<int, int> kju = make_pair(qs[i].l, qs[i].r);
    temp = prijelaz(lst, kju, temp);
    sol[qs[i].ind] = temp;
    lst = kju;
  }
  for (int i = 0; i < m; i++) cout << sol[i] << "\n";
  return 0;
}
