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 LIM = 200 * 1000, MAXN = 300 * 1000;
int fen[MAXN];
void add(int pos, int val) {
  pos++;
  while (pos < MAXN) {
    fen[pos] += val;
    pos += pos & -pos;
  }
}
int sum(int pos) {
  pos++;
  int tot = 0;
  while (pos) {
    tot += fen[pos];
    pos -= pos & -pos;
  }
  return tot;
}
bool by_id(pair<pair<int, int>, pair<int, int> > a,
           pair<pair<int, int>, pair<int, int> > b) {
  return a.second.first < b.second.first;
}
vector<int> occ[MAXN];
int pt[MAXN], a[MAXN], n, q;
pair<pair<int, int>, pair<int, int> > seg[MAXN];
int main() {
  cin >> n >> q;
  for (int i = 0; i < int(n); i++) {
    cin >> a[i];
    if (a[i] < LIM) occ[a[i]].push_back(i);
  }
  for (int i = 1; i < int(LIM); i++)
    if (i <= (int((occ[i]).size()))) {
      pt[i] = i - 1;
      add(occ[i][pt[i]], 1);
      if (pt[i] + 1 < (int((occ[i]).size()))) add(occ[i][pt[i] + 1], -1);
    } else
      pt[i] = (int((occ[i]).size()));
  cerr << "Salam :)" << endl;
  for (int i = 0; i < int(q); i++) {
    seg[i].second.first = i;
    cin >> seg[i].first.first >> seg[i].first.second;
    seg[i].first.first--;
    seg[i].first.second--;
  }
  sort(seg, seg + q);
  int cur = 0;
  for (int i = 0; i < int(n); i++) {
    while (cur < q && seg[cur].first.first == i) {
      seg[cur].second.second = sum(seg[cur].first.second);
      cur++;
    }
    int x = a[i];
    if (x < LIM && pt[x] < (int((occ[x]).size()))) {
      add(occ[x][pt[x]], -1);
      if (pt[x] + 1 < (int((occ[x]).size()))) add(occ[x][pt[x] + 1], +1);
      pt[x]++;
      if (pt[x] < (int((occ[x]).size()))) {
        add(occ[x][pt[x]], 1);
        if (pt[x] + 1 < (int((occ[x]).size()))) add(occ[x][pt[x] + 1], -1);
      }
    }
  }
  sort(seg, seg + q, by_id);
  for (int i = 0; i < int(q); i++) cout << seg[i].second.second << endl;
  return 0;
}
