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 N = 1e5 + 5;
long long BL[N], a[N];
struct query {
  long long l, r, id;
};
bool cmp(query a, query b) {
  if (BL[a.l] != BL[b.l]) return BL[a.l] < BL[b.l];
  return BL[a.l] % 2 ? a.r > b.r : a.r < b.r;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  vector<query> v(m);
  for (long long i = 0; i < m; i++) {
    long long l, r;
    cin >> v[i].l >> v[i].r;
    v[i].id = i;
  }
  long long size = sqrt(n);
  for (long long i = 1; i <= n; i++) BL[i] = (i - 1) / size + 1;
  sort(v.begin(), v.end(), cmp);
  long long cl = v[0].l, cr = v[0].l - 1;
  unordered_map<long long, long long> mp;
  long long ans = 0;
  long long out[m];
  for (long long i = 0; i < m; i++) {
    while (cl < v[i].l) {
      if (mp[a[cl]] == a[cl]) ans--;
      mp[a[cl]]--;
      if (mp[a[cl]] == a[cl]) ans++;
      cl++;
    }
    while (cl > v[i].l) {
      cl--;
      if (mp[a[cl]] == a[cl]) ans--;
      mp[a[cl]]++;
      if (mp[a[cl]] == a[cl]) ans++;
    }
    while (cr < v[i].r) {
      cr++;
      if (mp[a[cr]] == a[cr]) ans--;
      mp[a[cr]]++;
      if (mp[a[cr]] == a[cr]) ans++;
    }
    while (cr > v[i].r) {
      if (mp[a[cr]] == a[cr]) ans--;
      mp[a[cr]]--;
      if (mp[a[cr]] == a[cr]) ans++;
      cr--;
    }
    out[v[i].id] = ans;
  }
  for (long long i = 0; i < m; i++) cout << out[i] << '\n';
}
