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;
char _;
const long long N = 5e5 + 5;
const long long INF = 1e9;
const long long mod = 1e9 + 7;
const long long BLOCK = 550;
struct node {
  int l, r, id;
};
bool cmp(node &q1, node &q2) {
  int b1 = q1.l / BLOCK, b2 = q2.l / BLOCK;
  return b1 != b2 ? b1 < b2 : b1 & 1 ? q1.r < q2.r : q2.r < q1.r;
}
node q[N];
long long a[N];
long long noOfOcr[N];
long long currAns;
long long ans[N];
unordered_map<int, int> F, RF;
void add(int pos) {
  if (noOfOcr[F[a[pos]]] == a[pos]) currAns--;
  noOfOcr[F[a[pos]]]++;
  if (noOfOcr[F[a[pos]]] == a[pos]) currAns++;
}
void remove(int pos) {
  if (noOfOcr[F[a[pos]]] == a[pos]) currAns--;
  noOfOcr[F[a[pos]]]--;
  if (noOfOcr[F[a[pos]]] == a[pos]) currAns++;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m;
  cin >> n >> m;
  int cnt = 1;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (F.find(a[i]) == F.end()) {
      F[a[i]] = cnt;
      cnt++;
    }
  }
  for (int i = 0; i < m; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].id = i;
  }
  sort(q, q + m, cmp);
  int currL = q[0].l;
  int currR = q[0].l - 1;
  currAns = 0;
  for (int i = 0; i < m; i++) {
    while (currR < q[i].r) {
      currR++;
      add(currR);
    }
    while (currR > q[i].r) {
      remove(currR);
      currR--;
    }
    while (currL > q[i].l) {
      currL--;
      add(currL);
    }
    while (currL < q[i].l) {
      remove(currL);
      currL++;
    }
    ans[q[i].id] = currAns;
  }
  for (int i = 0; i < m; i++) cout << ans[i] << "\n";
}
