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;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(
      const pair<long long int, pair<long long int, long long int>> &p1,
      const pair<long long int, pair<long long int, long long int>> &p2) const {
    if (p1.first == p2.first) return true;
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
const long long int N = 1e5 + 10, inf = 4e18;
int cnt[N];
void solve() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> pos(n + 1);
  vector<long long> v(n), mp;
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    cin >> v[i];
    if (v[i] <= n) {
      cnt[v[i]]++;
      pos[v[i]].push_back(i);
    }
  }
  for (long long int i = (long long int)1; i < (long long int)(n + 1); i++) {
    if (cnt[i] >= i) mp.push_back(i);
  }
  int l, r, ans = 0;
  for (long long int i = (long long int)0; i < (long long int)(m); i++) {
    cin >> l >> r;
    l--;
    r--;
    ans = 0;
    for (auto p : mp) {
      if (upper_bound(pos[p].begin(), pos[p].end(), r) -
              lower_bound(pos[p].begin(), pos[p].end(), l) ==
          p)
        ans++;
    }
    cout << ans << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
