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 = 100005;
const int K = 720;
int arr[N], cnt[N];
long long ans[N];
int n, q, sz;
long long curAns;
vector<pair<pair<int, int>, int> > vec;
bool cmp(pair<pair<int, int>, int> &i, pair<pair<int, int>, int> &j) {
  if ((i.first.first / sz) != (j.first.first / sz))
    return (i.first.first / sz) < (j.first.first / sz);
  return i.first.second < j.first.second;
}
void change(int x, int flag) {
  if (x > 1e5) return;
  curAns -= (cnt[x] == x);
  cnt[x] += flag;
  curAns += (cnt[x] == x);
}
void solve() {
  sz = static_cast<int>(sqrt(n));
  sort(vec.begin(), vec.end(), cmp);
  int curLeft = 0, curRight = -1;
  for (int i = 0; i < q; ++i) {
    int left = vec[i].first.first;
    int right = vec[i].first.second;
    while (curRight != right) {
      if (curRight < right)
        change(arr[++curRight], 1);
      else
        change(arr[curRight--], -1);
    }
    while (curLeft != left) {
      if (curLeft < left)
        change(arr[curLeft++], -1);
      else
        change(arr[--curLeft], 1);
    }
    ans[vec[i].second] = curAns;
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  scanf("%d %d", &n, &q);
  vec.resize(q);
  for (int i = 0; i < n; ++i) scanf("%d", &arr[i]);
  for (int i = 0; i < q; ++i) {
    scanf("%d %d", &vec[i].first.first, &vec[i].first.second);
    --vec[i].first.first, --vec[i].first.second;
    vec[i].second = i;
  }
  solve();
  for (int i = 0; i < q; ++i) printf("%lld\n", ans[i]);
  return 0;
}
