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;
long long dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const long long maxn = 1e5 + 5;
long long a[maxn], cnt[maxn], ans[maxn], answer = 0, block, pos[maxn], b[maxn],
                                         c[maxn];
long long n, m;
struct node {
  long long l, r, id;
} q[maxn];
void init() {
  block = sqrt(n);
  for (int i = 1; i <= n; i++) {
    pos[i] = i / block;
  }
}
bool cmp(node a, node b) {
  if (pos[a.l] == pos[b.l]) return a.r < b.r;
  return a.l < b.l;
}
bool cmpid(node a, node b) { return a.id < b.id; }
void update(int id, int k) {
  if (k == 1) {
    cnt[a[id]]++;
    if (cnt[a[id]] == c[id])
      answer++;
    else if (cnt[a[id]] == c[id] + 1)
      answer--;
  } else {
    cnt[a[id]]--;
    if (cnt[a[id]] == c[id])
      answer++;
    else if (cnt[a[id]] + 1 == c[id])
      answer--;
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    b[i] = c[i] = a[i];
  }
  sort(b + 1, b + n + 1);
  int uq = unique(b + 1, b + n + 1) - (b + 1);
  for (int i = 1; i <= n; i++) {
    a[i] = lower_bound(b + 1, b + uq + 1, a[i]) - (b + 1);
  }
  for (long long i = 1; i <= m; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].id = i;
  }
  init();
  sort(q, q + m, cmp);
  int l = q[1].l, r = l - 1;
  for (int i = 1; i <= m; i++) {
    while (l < q[i].l) {
      update(l++, -1);
    }
    while (l > q[i].l) {
      update(--l, 1);
    }
    while (r > q[i].r) {
      update(r--, -1);
    }
    while (r < q[i].r) {
      update(++r, 1);
    }
    ans[q[i].id] = answer;
  }
  for (long long i = 1; i <= m; i++) cout << ans[i] << "\n";
  return 0;
}
