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 N = 1e5 + 5;
struct Query {
  int s, e;
  int pos;
} q[N];
bool cmp(Query a, Query b) { return a.e < b.e; }
vector<int> V[N];
int n, m;
int a[N], cnt[N];
int pre[N][2];
int ans[N];
int sum[4 * N];
void relax(int num) {
  int &s = sum[num];
  sum[num << 1] += sum[num];
  sum[num << 1 | 1] += sum[num];
  s = 0;
}
void PushUp(int num) { sum[num] = sum[num << 1] + sum[num << 1 | 1]; }
void build(int l, int r, int num) {
  if (l == r) return;
  int mid = (l + r) / 2;
  build(l, mid, 2 * num);
  build(mid + 1, r, 2 * num + 1);
}
void update(int L, int R, int l, int r, int num, int add) {
  if (L <= l && R >= r) {
    sum[num] += add;
    return;
  }
  relax(num);
  int mid = (l + r) / 2;
  if (L <= mid) update(L, R, l, mid, 2 * num, add);
  if (R > mid) update(L, R, mid + 1, r, 2 * num + 1, add);
}
int query(int pos, int l, int r, int num) {
  if (l == r) return sum[num];
  relax(num);
  int mid = (l + r) / 2;
  if (pos <= mid)
    return query(pos, l, mid, 2 * num);
  else
    return query(pos, mid + 1, r, 2 * num + 1);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  build(1, n, 1);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &q[i].s, &q[i].e);
    q[i].pos = i;
  }
  sort(q + 1, q + m + 1, cmp);
  memset(cnt, 0, sizeof(cnt));
  memset(sum, 0, sizeof(sum));
  int num = 1;
  for (int i = 1; i <= n; i++) {
    int v = a[i];
    if (v <= n) {
      cnt[v]++;
      V[v].push_back(i);
      if (cnt[v] == v) {
        pre[v][0] = 1;
        pre[v][1] = V[v][0];
        update(pre[v][0], pre[v][1], 1, n, 1, 1);
      } else if (cnt[v] > v) {
        update(pre[v][0], pre[v][1], 1, n, 1, -1);
        pre[v][0] = pre[v][1] + 1;
        pre[v][1] = V[v][cnt[v] - v];
        update(pre[v][0], pre[v][1], 1, n, 1, 1);
      }
    }
    while (q[num].e == i && num <= m) {
      ans[q[num].pos] = query(q[num].s, 1, n, 1);
      num++;
    }
  }
  for (int i = 1; i <= m; i++) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
