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>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
using namespace std;
using lli = long long;
using ld = long double;
mt19937 rnd(time(nullptr));
const int block = 350;
struct Value {
  int l, r, id;
};
bool operator<(const Value& a, const Value& b) {
  int val1 = a.l / block, val2 = b.l / block;
  if (val1 != val2) return a.l < b.l;
  if (val1 & 1) return a.r > b.r;
  return a.r < b.r;
}
const int MAX_SZ = 1e6;
int n = 0, m = 0;
vector<int> data;
vector<Value> qrs;
int Left = 1, Right = 0;
int result = 0;
vector<int> answer;
unordered_map<int, int> counter(MAX_SZ);
void IncLeft() {
  counter[data[Left]]--;
  if (counter[data[Left]] == data[Left])
    result++;
  else if (counter[data[Left]] + 1 == data[Left])
    result--;
  Left++;
}
void DecLeft() {
  Left--;
  if (counter[data[Left]] == data[Left])
    result--;
  else if (counter[data[Left]] + 1 == data[Left])
    result++;
  counter[data[Left]]++;
}
void IncRight() {
  Right++;
  if (counter[data[Right]] == data[Right])
    result--;
  else if (counter[data[Right]] + 1 == data[Right])
    result++;
  counter[data[Right]]++;
}
void DecRight() {
  counter[data[Right]]--;
  if (counter[data[Right]] == data[Right])
    result++;
  else if (counter[data[Right]] + 1 == data[Right])
    result--;
  Right--;
}
void Process(Value& current) {
  while (Right < current.r) IncRight();
  while (Left < current.l) IncLeft();
  while (Left > current.l) DecLeft();
  while (Right > current.r) DecRight();
  answer[current.id] = result;
}
inline void Solve() {
  counter.rehash(MAX_SZ);
  cin >> n >> m;
  data.resize(n);
  for (auto& it : data) cin >> it;
  qrs.resize(m);
  for (int i = 0; i < m; i++) {
    cin >> qrs[i].l >> qrs[i].r;
    qrs[i].l--, qrs[i].r--;
    qrs[i].id = i;
  }
  sort(qrs.begin(), qrs.end());
  answer.resize(m);
  for (auto& it : qrs) Process(it);
  for (auto& it : answer) cout << it << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cout << fixed << setprecision(20);
  Solve();
  return 0;
}
