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 maxN = (int)(1e5 + 10);
int n, m;
int arr[maxN];
map<int, int> cnt;
vector<int> vals;
pair<int, int> q[maxN];
int num[maxN], ans[maxN];
int main(int argc, char** argv) {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    if (arr[i] < maxN - 5) cnt[arr[i]]++;
  }
  for (map<int, int>::iterator it = cnt.begin(); it != cnt.end(); it++) {
    if ((*it).first <= (*it).second) vals.push_back((*it).first);
  }
  int a, b;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    a--;
    b--;
    q[i] = pair<int, int>(a, b);
  }
  for (int i = 0; i < (int)vals.size(); i++) {
    for (int j = 0; j < n; j++) num[j + 1] = num[j] + (arr[j] == vals[i]);
    for (int j = 0; j < m; j++) {
      int l = q[j].first, r = q[j].second;
      if (num[r + 1] - num[l] == vals[i]) ans[j]++;
    }
  }
  for (int i = 0; i < m; i++) cout << ans[i] << '\n';
  return 0;
}
