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;
int input[100000];
int output[100000];
pair<pair<int, int>, int> queries[100000];
int blockSize;
bool mo_compare(pair<pair<int, int>, int>& x, pair<pair<int, int>, int>& y) {
  int firstBlockIndex = x.first.first / blockSize;
  int secondBlockIndex = y.first.first / blockSize;
  if (firstBlockIndex == secondBlockIndex) {
    return x.first.second < y.first.second;
  }
  return firstBlockIndex < secondBlockIndex;
}
void inline removeElement(unordered_map<int, int>& lookup, int val,
                          int& result) {
  unordered_map<int, int>::iterator itr = lookup.find(val);
  if (itr != lookup.end()) {
    if (itr->first == itr->second) {
      result--;
    }
    itr->second--;
    if (itr->first == itr->second) {
      result++;
    }
  } else {
    lookup[val]--;
  }
}
void inline addElement(unordered_map<int, int>& lookup, int val, int& result) {
  unordered_map<int, int>::iterator itr = lookup.find(val);
  if (itr != lookup.end()) {
    if (itr->first == itr->second) {
      result--;
    }
    itr->second++;
    if (itr->first == itr->second) {
      result++;
    }
  } else {
    lookup[val]++;
    if (val == 1) {
      result++;
    }
  }
}
int main() {
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  blockSize = static_cast<int>(sqrt(n));
  for (int i = 0; i < n; i++) {
    cin >> input[i];
  }
  for (int i = 0; i < m; i++) {
    pair<pair<int, int>, int>& query = queries[i];
    cin >> query.first.first >> query.first.second;
    query.first.first--;
    query.first.second--;
    query.second = i;
  }
  sort(queries, queries + m, mo_compare);
  unordered_map<int, int> lookup;
  int result = 0;
  int prev_l = 0, prev_r = -1, left, right, index;
  unordered_map<int, int>::iterator itr;
  for (int i = 0; i < m; i++) {
    left = queries[i].first.first;
    right = queries[i].first.second;
    index = queries[i].second;
    while (left > prev_l) {
      removeElement(lookup, input[prev_l], result);
      prev_l++;
    }
    while (left < prev_l) {
      prev_l--;
      addElement(lookup, input[prev_l], result);
    }
    while (right < prev_r) {
      removeElement(lookup, input[prev_r], result);
      prev_r--;
    }
    while (right > prev_r) {
      prev_r++;
      addElement(lookup, input[prev_r], result);
    }
    output[index] = result;
  }
  for (int i = 0; i < m; i++) {
    cout << output[i] << '\n';
  }
  return 0;
}
