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;
struct qry {
  int L;
  int R;
  int id;
};
bool cmp(qry q1, qry q2) {
  if (q1.R == q2.R) return q1.L < q2.L;
  return q1.R < q2.R;
}
int n, m;
int ara[100000 + 5];
int blcSize, blcCnt;
vector<qry> blocks[350 + 2];
int ans[100000];
int main() {
  cin >> n >> m;
  blcSize = sqrt(n);
  blcCnt = n / blcSize;
  if (n % blcSize) blcCnt++;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    ara[i] = x;
  }
  for (int i = 0; i < m; i++) {
    int l, r;
    cin >> l >> r;
    l--;
    r--;
    blocks[l / blcSize].push_back({l, r, i});
  }
  for (int blc = 0; blc < blcCnt; blc++) {
    if (blocks[blc].size() == 0) continue;
    sort(blocks[blc].begin(), blocks[blc].end(), cmp);
    unordered_map<int, int> frq;
    int okay = 0;
    for (int j = blocks[blc][0].L; j <= blocks[blc][0].R; j++) {
      if (frq[ara[j]] == ara[j]) okay--;
      frq[ara[j]]++;
      if (frq[ara[j]] == ara[j]) okay++;
    }
    ans[blocks[blc][0].id] = okay;
    int l = blocks[blc][0].L;
    int r = blocks[blc][0].R;
    for (int j = 1; j < blocks[blc].size(); j++) {
      qry q = blocks[blc][j];
      while (l < q.L) {
        if (frq[ara[l]] == ara[l]) okay--;
        frq[ara[l]]--;
        if (frq[ara[l]] == ara[l]) okay++;
        l++;
      }
      while (l > q.L) {
        l--;
        if (frq[ara[l]] == ara[l]) okay--;
        frq[ara[l]]++;
        if (frq[ara[l]] == ara[l]) okay++;
      }
      while (r < q.R) {
        r++;
        if (frq[ara[r]] == ara[r]) okay--;
        frq[ara[r]]++;
        if (frq[ara[r]] == ara[r]) okay++;
      }
      while (r > q.R) {
        if (frq[ara[r]] == ara[r]) okay--;
        frq[ara[r]]--;
        if (frq[ara[r]] == ara[r]) okay++;
        r--;
      }
      ans[q.id] = okay;
    }
  }
  for (int i = 0; i < m; i++) {
    cout << ans[i] << "\n";
  }
  return 0;
}
