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;
using ll = long long;
int S;
struct Query {
  int l, r, idx;
  bool operator<(Query other) const {
    return make_pair(l / S, r) < make_pair(other.l / S, other.r);
  }
};
const int N = 1e5 + 2;
vector<Query> Q(N);
vector<ll> ar(N, 0);
vector<ll> ans(N, 0);
unordered_map<ll, int> F;
int n, m;
ll answer;
void add(int x) {
  if (F[ar[x]] == ar[x]) answer--;
  F[ar[x]]++;
  if (F[ar[x]] == ar[x]) answer++;
}
void remove(int x) {
  if (F[ar[x]] == ar[x]) answer--;
  F[ar[x]]--;
  if (F[ar[x]] == ar[x]) answer++;
}
ll getAns() { return answer; }
vector<ll> mo_s_algorithm() {
  S = (int)sqrt(n + 0.0) + 1;
  sort(Q.begin(), Q.begin() + m);
  int cur_l = 0, cur_r = -1;
  answer = 0LL;
  for (int i = 0; i < m; i++) {
    auto q = Q[i];
    while (cur_l > q.l) {
      cur_l--;
      add(cur_l);
    }
    while (cur_r > q.r) {
      remove(cur_r);
      cur_r--;
    }
    while (cur_l < q.l) {
      remove(cur_l);
      cur_l++;
    }
    while (cur_r < q.r) {
      cur_r++;
      add(cur_r);
    }
    ans[q.idx] = getAns();
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
  }
  for (int i = 0; i < m; i++) {
    int l, r;
    cin >> l >> r;
    Q[i].l = l;
    Q[i].r = r;
    Q[i].idx = i;
  }
  auto a = mo_s_algorithm();
  for (int i = 0; i < m; i++) {
    cout << a[i] << "\n";
  }
  return 0;
}
