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;
typedef struct {
  int f, s, i;
} hehe;
hehe qry[100009];
int f[100009];
int a[100009], b[100009], vans[100009], c[100009];
int bsz;
map<int, int> m;
bool comp(hehe a, hehe b) {
  if (a.f / bsz != b.f / bsz) return a.f / bsz < b.f / bsz;
  return a.s < b.s;
}
void mos(int n, int mq) {
  bsz = static_cast<int>(floor(sqrt(n)));
  sort(qry, qry + mq, comp);
  int cr = 0, cl = 0, ans = 0;
  for (int i = 0; i < mq; i++) {
    int l = qry[i].f;
    int r = qry[i].s;
    while (cl < l) {
      f[a[cl]]--;
      if (f[a[cl]] == c[cl] - 1) ans--;
      if (f[a[cl]] == c[cl]) ans++;
      cl++;
    }
    while (cl > l) {
      cl--;
      f[a[cl]]++;
      if (f[a[cl]] == c[cl]) ans++;
      if (f[a[cl]] == c[cl] + 1) ans--;
    }
    while (cr <= r) {
      f[a[cr]]++;
      if (f[a[cr]] == c[cr]) ans++;
      if (f[a[cr]] == c[cr] + 1) ans--;
      cr++;
    }
    while (cr > r + 1) {
      cr--;
      f[a[cr]]--;
      if (f[a[cr]] == c[cr] - 1) ans--;
      if (f[a[cr]] == c[cr]) ans++;
    }
    vans[qry[i].i] = ans;
  }
}
int main() {
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    b[i] = c[i] = a[i];
  }
  sort(b, b + n);
  int cnt = 1;
  for (int i = 1; i <= n; i++) {
    if (i > 0 && b[i] == b[i - 1]) continue;
    m[b[i]] = cnt++;
  }
  for (int i = 1; i <= n; i++) a[i] = m[a[i]];
  for (int i = 0; i < q; i++) cin >> qry[i].f >> qry[i].s, qry[i].i = i;
  mos(n, q);
  for (int i = 0; i < q; i++) cout << vans[i] << endl;
}
