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 = 1e6 + 1;
int block_size = 555;
pair<pair<int, int>, int> query[maxn];
int ans[maxn], answer = 0, a[maxn], cnt[maxn];
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / block_size == b.first.first / block_size)
    return a.first.second < b.first.second;
  return a.first.first / block_size < b.first.first / block_size;
}
void add(int val) {
  if (val > 100000) return;
  if (cnt[val] == val) answer--;
  cnt[val]++;
  if (cnt[val] == val) answer++;
}
void remove(int val) {
  if (val > 100000) return;
  if (cnt[val] == val) answer--;
  cnt[val]--;
  if (cnt[val] == val) answer++;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    query[i].first.first = l - 1;
    query[i].first.second = r - 1;
    query[i].second = i;
  }
  sort(query, query + q, cmp);
  int c_left = 0, c_right = 0;
  for (int i = 0; i < q; i++) {
    int left = query[i].first.first;
    int right = query[i].first.second;
    int ind = query[i].second;
    while (c_left < left) {
      remove(a[c_left]);
      c_left++;
    }
    while (c_left > left) {
      c_left--;
      add(a[c_left]);
    }
    while (c_right <= right) {
      add(a[c_right]);
      c_right++;
    }
    while (c_right > right + 1) {
      c_right--;
      remove(a[c_right]);
    }
    ans[ind] = answer;
  }
  for (int i = 0; i < q; i++) cout << ans[i] << endl;
  return 0;
}
