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 mx = 1e5 + 10;
int n, m;
int a[mx];
int b[mx];
int bl[mx];
int t[mx];
int blk;
int cnt = 0;
struct Node {
  int l, r;
  int id;
  int ans;
} q[mx];
void init() {
  blk = sqrt(n);
  sort(b + 1, b + n + 1);
  int num = unique(b + 1, b + n + 1) - b - 1;
  for (int i = 1; i <= n; ++i) {
    bl[i] = (i + blk - 1) / blk;
    a[i] = lower_bound(b + 1, b + num + 1, a[i]) - b;
  }
}
bool cmp(const Node &a, const Node &b) {
  if (bl[a.l] == bl[b.l]) return a.r < b.r;
  return a.l < b.l;
}
bool cmp2(const Node &a, const Node &b) { return a.id < b.id; }
void del(int x) {
  if (t[a[x]] == b[a[x]])
    --cnt;
  else if (t[a[x]] == b[a[x]] + 1)
    ++cnt;
  --t[a[x]];
}
void up(int x) {
  if (t[a[x]] == b[a[x]])
    --cnt;
  else if (t[a[x]] == b[a[x]] - 1)
    ++cnt;
  ++t[a[x]];
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d", &q[i].l, &q[i].r);
    q[i].id = i;
  }
  init();
  sort(q + 1, q + m + 1, cmp);
  int ls = 1, rs = 0;
  for (int i = 1; i <= m; ++i) {
    while (ls < q[i].l) del(ls++);
    while (ls > q[i].l) up(--ls);
    while (rs < q[i].r) up(++rs);
    while (rs > q[i].r) del(rs--);
    q[i].ans = cnt;
  }
  sort(q + 1, q + m + 1, cmp2);
  for (int i = 1; i <= m; ++i) printf("%d\n", q[i].ans);
}
