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 data() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
}
int dx[5] = {-1, 0, 0, 1};
int dy[5] = {0, -1, 1, 0};
const int N = 1e5 + 100;
const long long mod = 1e9 + 7;
const long long big = 1e9;
struct t {
  int l, r, pos;
} q[N];
int n, m;
int a[N];
int block;
int was[N];
bool comp(t a, t b) {
  if (a.l / block == b.l / block) {
    return a.r < b.r;
  }
  return a.l < b.l;
}
int cur;
int ans[N];
void add(int pos) {
  if (a[pos] > n) {
    return;
  }
  if (was[a[pos]] == a[pos]) {
    cur--;
  }
  was[a[pos]]++;
  if (was[a[pos]] == a[pos]) {
    cur++;
  }
}
void del(int pos) {
  if (a[pos] > n) {
    return;
  }
  if (was[a[pos]] == a[pos]) {
    cur--;
  }
  was[a[pos]]--;
  if (was[a[pos]] == a[pos]) {
    cur++;
  }
}
int main() {
  data();
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  block = sqrt(n) + 10;
  for (int i = 1; i <= m; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].pos = i;
  }
  sort(q + 1, q + m + 1, comp);
  int l = 1, r = 0;
  for (int i = 1; i <= m; i++) {
    while (l < q[i].l) {
      del(l);
      l++;
    }
    while (l > q[i].l) {
      add(l - 1);
      l--;
    }
    while (r < q[i].r) {
      add(r + 1);
      r++;
    }
    while (r > q[i].r) {
      del(r);
      r--;
    }
    ans[q[i].pos] = cur;
  }
  for (int i = 1; i <= m; i++) {
    cout << ans[i] << "\n";
  }
}
