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 maxn = 1e5 + 10;
int a[maxn], num[maxn] = {0}, Ki[maxn] = {0}, ans = 0, res[maxn], b[maxn], m, n;
struct node {
  int ai, id, pi;
} cc[maxn];
bool tmp(node a, node b) { return a.ai < b.ai; }
struct Node {
  int l, r, id;
  Node() {}
  Node(int x, int y, int z) : l(x), r(y), id(z) {}
} cur[maxn];
bool cmp(Node a, Node b) {
  if (Ki[a.l] == Ki[b.l]) return a.r < b.r;
  return a.l < b.l;
}
void Add(int x, int d) {
  if (d > 0) {
    if (num[a[x]] + 1 == b[x])
      ans++;
    else if (num[a[x]] == b[x])
      ans--;
    num[a[x]]++;
  } else if (d < 0) {
    if (num[a[x]] == b[x])
      ans--;
    else if (num[a[x]] - 1 == b[x])
      ans++;
    num[a[x]]--;
  }
}
int main(void) {
  scanf("%d%d", &n, &m);
  int unit = (int)sqrt(n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &cc[i].ai);
    cc[i].id = i;
    Ki[i] = i / unit + 1;
    b[i] = cc[i].ai;
  }
  sort(cc + 1, cc + n + 1, tmp);
  cc[0].ai = -1;
  cc[0].id = 0;
  cc[0].pi = 0;
  for (int i = 1; i <= n; i++) {
    if (cc[i].ai > cc[i - 1].ai)
      cc[i].pi = cc[i - 1].pi + 1;
    else
      cc[i].pi = cc[i - 1].pi;
    a[cc[i].id] = cc[i].pi;
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &cur[i].l, &cur[i].r);
    cur[i].id = i;
  }
  sort(cur + 1, cur + 1 + m, cmp);
  int l = 1, r = 0;
  for (int i = 1; i <= m; i++) {
    while (l < cur[i].l) {
      Add(l, -1);
      l++;
    }
    while (l > cur[i].l) {
      Add(l - 1, 1);
      l--;
    }
    while (r < cur[i].r) {
      Add(r + 1, 1);
      r++;
    }
    while (r > cur[i].r) {
      Add(r, -1);
      r--;
    }
    res[cur[i].id] = ans;
  }
  for (int i = 1; i <= m; i++) printf("%d\n", res[i]);
  return 0;
}
