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 n, m, a[100001], l, r, BLOCK_SIZE, res[100001], curL = 1, curR = 1, ans = 0,
                                                    f[100001];
vector<pair<pair<int, int>, int> > queries(100001);
bool mo_cmp(const pair<pair<int, int>, int> &a,
            const pair<pair<int, int>, int> &b) {
  if (a.first.first / BLOCK_SIZE != b.first.first / BLOCK_SIZE)
    return a.first.first < b.first.first;
  return a.first.second < b.first.second;
}
void add(int pos) {
  if (a[pos] <= n) {
    if (f[a[pos]] == a[pos]) ans--;
    f[a[pos]]++;
    if (f[a[pos]] == a[pos]) ans++;
  }
}
void del(int pos) {
  if (a[pos] <= n) {
    if (f[a[pos]] == a[pos]) ans--;
    f[a[pos]]--;
    if (f[a[pos]] == a[pos]) ans++;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  BLOCK_SIZE = sqrt(n);
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < m; i++) {
    cin >> l >> r;
    queries[i] = {{l, r}, i};
  }
  sort(queries.begin(), queries.begin() + m, mo_cmp);
  for (int i = 0; i < m; i++) {
    l = queries[i].first.first;
    r = queries[i].first.second;
    while (curL < l) del(curL++);
    while (curL > l) add(--curL);
    while (curR <= r) add(curR++);
    while (curR > r + 1) del(--curR);
    res[queries[i].second] = ans;
  }
  for (int i = 0; i < m; i++) cout << res[i] << endl;
  return 0;
}
