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;
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
const int N = 4e5 + 10;
const int M = 5e5 + 10;
const long long MOD = 1e9 + 7;
const long long p1 = 57, M1 = 1e9 + 3;
const int rx[4] = {-1, 0, 1, 0};
const int ry[4] = {0, 1, 0, -1};
const int hx[8] = {-2, -2, -1, 1, 2, 2, 1, -1};
const int hy[8] = {-1, 1, 2, 2, 1, -1, -2, -2};
const long double eps = 1e-7;
const double pi = acos(-1.0);
const long long INF = 1e9 + 1000;
int sq;
bool comp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / sq == b.first.first / sq)
    return (a.first.second < b.first.second);
  else
    return (a.first.first / sq < b.first.first / sq);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> kol(n + 1, 0);
  int kok = 0;
  vector<pair<pair<int, int>, int> > lr(m);
  for (int i = 0; i < m; i++) {
    cin >> lr[i].first.first >> lr[i].first.second;
    lr[i].first.first--;
    lr[i].first.second--;
    lr[i].second = i;
  }
  sq = sqrt(n);
  sort(lr.begin(), lr.end(), comp);
  int l = lr[0].first.first, r = lr[0].first.second;
  for (int i = l; i <= r; i++) {
    if (a[i] <= n) {
      kol[a[i]]++;
      if (kol[a[i]] == a[i])
        kok++;
      else if (kol[a[i]] == a[i] + 1)
        kok--;
    }
  }
  int ans[m];
  ans[lr[0].second] = kok;
  for (int i = 1; i < m; i++) {
    while (r < lr[i].first.second) {
      r++;
      kol[a[r]]++;
      if (kol[a[r]] == a[r])
        kok++;
      else if (kol[a[r]] == a[r] + 1)
        kok--;
    }
    while (l > lr[i].first.first) {
      l--;
      kol[a[l]]++;
      if (kol[a[l]] == a[l])
        kok++;
      else if (kol[a[l]] == a[l] + 1)
        kok--;
    }
    while (r > lr[i].first.second) {
      kol[a[r]]--;
      if (kol[a[r]] == a[r])
        kok++;
      else if (kol[a[r]] == a[r] - 1)
        kok--;
      r--;
    }
    while (l < lr[i].first.first) {
      kol[a[l]]--;
      if (kol[a[l]] == a[l])
        kok++;
      else if (kol[a[l]] == a[l] - 1)
        kok--;
      l++;
    }
    ans[lr[i].second] = kok;
  }
  for (int i = 0; i < m; i++) {
    cout << ans[i] << '\n';
  }
  return 0;
}
