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 long long K = 330;
int32_t main() {
  ios_base::sync_with_stdio(0);
  long long n, m;
  cin >> n >> m;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<long long> b = a;
  map<long long, long long> M;
  for (long long i = 0; i < n; i++) {
    M[b[i]] = i;
  }
  for (long long i = 0; i < n; i++) {
    a[i] = M[a[i]];
  }
  vector<vector<pair<long long, pair<long long, long long>>>> q((n - 1) / K +
                                                                1);
  for (long long i = 0; i < m; i++) {
    long long l, r;
    cin >> l >> r;
    l--;
    q[l / K].push_back({r, {l, i}});
  }
  vector<long long> ans(m);
  for (long long i = 0; i < q.size(); i++) {
    long long l = i * K, r = i * K;
    sort(q[i].begin(), q[i].end());
    vector<long long> cnt(n, 0);
    long long cur_ans = 0;
    for (long long j = 0; j < q[i].size(); j++) {
      long long cur_l = q[i][j].second.first, cur_r = q[i][j].first,
                ind = q[i][j].second.second;
      while (r < cur_r) {
        if (cnt[a[r]] == b[a[r]]) {
          cur_ans--;
        }
        cnt[a[r]]++;
        if (cnt[a[r]] == b[a[r]]) {
          cur_ans++;
        }
        r++;
      }
      while (l > cur_l) {
        l--;
        if (cnt[a[l]] == b[a[l]]) {
          cur_ans--;
        }
        cnt[a[l]]++;
        if (cnt[a[l]] == b[a[l]]) {
          cur_ans++;
        }
      }
      while (l < cur_l) {
        if (cnt[a[l]] == b[a[l]]) {
          cur_ans--;
        }
        cnt[a[l]]--;
        if (cnt[a[l]] == b[a[l]]) {
          cur_ans++;
        }
        l++;
      }
      ans[ind] = cur_ans;
    }
  }
  for (long long i = 0; i < m; i++) {
    cout << ans[i] << endl;
  }
}
