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;
int const N = 1e5 + 5;
unordered_map<int, int> cp;
int org[N];
int id = 0;
int qs[N], qe[N], qi[N], qa[N];
int n, m;
int arr[N];
int p1, p2;
int freq[N];
set<int> res;
void add(int x) {
  if (freq[x] == org[x]) {
    res.erase(x);
  }
  freq[x]++;
  if (freq[x] == org[x]) res.insert(x);
}
void del(int x) {
  if (freq[x] == org[x]) {
    res.erase(x);
  }
  freq[x]--;
  if (freq[x] == org[x]) res.insert(x);
}
void solve(int qn) {
  int a = qs[qn];
  int b = qe[qn];
  while (p2 <= b) {
    add(arr[p2++]);
  }
  while (p1 > a) {
    add(arr[--p1]);
  }
  while (p2 - 1 > b) {
    del(arr[--p2]);
  }
  while (p1 < a) {
    del(arr[p1++]);
  }
  qa[qn] = res.size();
}
void MO() {
  int sq = sqrt(n);
  sort(qi, qi + m, [sq](int a, int b) {
    return make_pair(qs[a] / sq, qe[a]) < make_pair(qs[b] / sq, qe[b]);
  });
  for (int i = 0; i < m; i++) {
    solve(qi[i]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  int x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    if (cp.find(x) == cp.end()) {
      cp[x] = id;
      org[id++] = x;
    }
    arr[i] = cp[x];
  }
  for (int i = 0; i < m; i++) {
    qi[i] = i;
    cin >> qs[i] >> qe[i];
    qs[i]--;
    qe[i]--;
  }
  MO();
  for (int i = 0; i < m; i++) {
    cout << qa[i] << '\n';
  }
  return 0;
}
