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;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans % m;
}
const int N = 1e5 + 5;
const int inf = 1e6;
struct query {
  int l, r, id;
} q[100005];
int bs;
bool cmp(struct query q1, struct query q2) {
  if (q1.l / bs != q2.l / bs)
    return q1.l / bs < q2.l / bs;
  else
    return q1.r < q2.r;
}
vector<int> v;
struct mo {
  vector<int> f = vector<int>(100005, 0);
  int ans = 0;
  int l = -1;
  int r = -1;
  void addr() {
    r++;
    if (v[r] <= 100000) {
      f[v[r]]++;
      if (f[v[r]] == v[r]) ans++;
      if (f[v[r]] == v[r] + 1) ans--;
    }
  }
  void remover() {
    if (v[r] <= 100000) {
      if (f[v[r]] == v[r] + 1) ans++;
      if (f[v[r]] == v[r]) ans--;
      f[v[r]]--;
    }
    r--;
  }
  void addl() {
    l++;
    if (v[l] <= 100000) {
      f[v[l]]--;
      if (f[v[l]] == v[l]) ans++;
      if (f[v[l]] == v[l] - 1) ans--;
    }
  }
  void removel() {
    if (v[l] <= 100000) {
      f[v[l]]++;
      if (f[v[l]] == v[l] + 1) ans--;
      if (f[v[l]] == v[l]) ans++;
    }
    l--;
  }
};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, m;
  cin >> n >> m;
  v.resize(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  bs = (int)sqrt(n);
  for (int i = 0; i < m; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].l--;
    q[i].r--;
    q[i].id = i;
  }
  sort(q, q + m, cmp);
  vector<int> ans(m);
  struct mo my;
  for (int i = 0; i < m; i++) {
    while (my.r < q[i].r) {
      my.addr();
    }
    while (my.r > q[i].r) {
      my.remover();
    }
    while (my.l < q[i].l - 1) {
      my.addl();
    }
    while (my.l > q[i].l - 1) {
      my.removel();
    }
    ans[q[i].id] = my.ans;
  }
  for (int i = 0; i < m; i++) cout << ans[i] << "\n";
  return 0;
}
