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 mxn = 1e5;
int arr[mxn + 3];
int block_size;
struct Query {
  int l, r, idx;
  bool operator<(Query other) const {
    return make_pair(l / block_size, r) <
           make_pair(other.l / block_size, other.r);
  }
};
int ans;
unordered_map<int, int> mp;
void add(int idx) {
  if (mp.count(arr[idx]) and mp[arr[idx]] == arr[idx]) ans--;
  mp[arr[idx]]++;
  if (mp[arr[idx]] == arr[idx]) ans++;
}
void del(int idx) {
  if (mp[arr[idx]] == arr[idx]) ans--;
  mp[arr[idx]]--;
  if (mp[arr[idx]] == arr[idx]) ans++;
}
void tc() {
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> arr[i];
  int l, r;
  vector<Query> qry;
  block_size = sqrt(n) + 1;
  for (int i = 0; i < q; i++) {
    cin >> l >> r;
    --l;
    --r;
    qry.push_back({l, r, i + 1});
  }
  sort(qry.begin(), qry.end());
  int idx;
  vector<int> fans(q + 1, 0);
  int cur_l = 0;
  int cur_r = -1;
  for (int i = 0; i < q; i++) {
    l = qry[i].l;
    r = qry[i].r;
    idx = qry[i].idx;
    while (cur_l > l) {
      cur_l--;
      add(cur_l);
    }
    while (cur_r < r) {
      cur_r++;
      add(cur_r);
    }
    while (cur_l < l) {
      del(cur_l);
      cur_l++;
    }
    while (cur_r > r) {
      del(cur_r);
      cur_r--;
    }
    fans[idx] = ans;
  }
  for (int i = 0; i < q; i++) cout << fans[i + 1] << "\n";
  cout << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  t = 1;
  while (t--) tc();
}
