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;
struct node {
  int L, R, i;
} q[100001];
bool cmp(node x, node y) {
  if (x.L / 555 != y.L / 555) {
    return x.L / 555 < y.L / 555;
  }
  return x.R < y.R;
}
map<int, int> mpp;
int ans = 0, I;
int arr[100000 + 1], ct[100001], arr2[100001];
void add(int p) {
  ct[arr2[p]]++;
  if (ct[arr2[p]] == arr[p]) {
    ans++;
  }
  if (ct[arr2[p]] == arr[p] + 1) ans--;
}
void rem(int p) {
  if (ct[arr2[p]] == arr[p]) ans--;
  if (ct[arr2[p]] == arr[p] + 1) ans++;
  ct[arr2[p]]--;
}
int main() {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int> > V;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    V.push_back(make_pair(arr[i], i));
  }
  sort(V.begin(), V.end());
  int r = 0;
  for (int i = 0; i < V.size(); i++) {
    if (i && V[i].first != V[i - 1].first) r++;
    arr2[V[i].second] = r;
  }
  int x, y;
  for (int i = 0; i < m; i++) {
    cin >> q[i].L >> q[i].R;
    q[i].i = i;
  }
  sort(q, q + m, cmp);
  x = q[0].L, y = q[0].R;
  for (int i = x; i <= y; i++) {
    ct[arr2[i]]++;
    if (ct[arr2[i]] == arr[i]) ans++;
    if (ct[arr2[i]] == arr[i] + 1) ans--;
  }
  int out[m];
  out[q[0].i] = ans;
  for (I = 1; I < m; I++) {
    int l = q[I].L, r = q[I].R;
    while (x < l) {
      rem(x);
      x++;
    }
    while (x > l) {
      x--;
      add(x);
    }
    while (y < r) {
      y++;
      add(y);
    }
    while (y > r) {
      rem(y);
      y--;
    }
    out[q[I].i] = ans;
  }
  for (int i = 0; i < m; i++) {
    cout << out[i] << "\n";
  }
  return 0;
}
