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;
const int INP_SIZE = 100010;
const int QUERIES_SIZE = 100010;
const int SQRTN = sqrt(INP_SIZE);
struct query {
  int l, r, q_idx, block_idx;
  query() {}
  query(int _l, int _r, int _q_idx) {
    l = _l - 1, r = _r - 1, q_idx = _q_idx, block_idx = _l / SQRTN;
  }
  bool operator<(const query &y) const {
    if (block_idx != y.block_idx) return block_idx < y.block_idx;
    return r < y.r;
  }
};
int n, m, a[100100], Ans = 0;
int Query[100100], cnt[100100];
query queries[100100];
void add(int idx) {
  if (a[idx] <= 1e5) {
    cnt[a[idx]]++;
    if (cnt[a[idx]] == a[idx]) Ans++;
    if (cnt[a[idx]] == a[idx] + 1) Ans--;
  }
}
void Remove(int idx) {
  if (a[idx] <= 1e5) {
    cnt[a[idx]]--;
    if (cnt[a[idx]] == a[idx]) Ans++;
    if (cnt[a[idx]] == a[idx] - 1) Ans--;
  }
}
void process() {
  sort(queries, queries + m);
  int curL = 1, curR = 0;
  for (int i = 0; i < m; i++) {
    while (curL > queries[i].l) add(--curL);
    while (curR < queries[i].r) add(++curR);
    while (curL < queries[i].l) Remove(curL++);
    while (curR > queries[i].r) Remove(curR--);
    Query[queries[i].q_idx] = Ans;
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < m; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    queries[i] = query(l, r, i);
  }
  process();
  for (int i = 0; i < m; i++) printf("%d\n", Query[i]);
}
