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;
long long arr[100005];
long long fin[100005];
long long mp[100005];
struct query {
  long long l, r, id;
} qu[100005];
long long k;
bool cmp(query &a, query &b) {
  long long block_a = a.l / k;
  long long block_b = b.l / k;
  if (block_a == block_b) return a.r < b.r;
  return block_a < block_b;
}
long long cnt = 0;
long long l = 1, r = 0;
void add(long long ind) {
  if (arr[ind] == mp[arr[ind]]) cnt--;
  mp[arr[ind]]++;
  if (arr[ind] == mp[arr[ind]]) cnt++;
}
void rmv(long long ind) {
  if (arr[ind] == mp[arr[ind]]) cnt--;
  mp[arr[ind]]--;
  if (arr[ind] == mp[arr[ind]]) cnt++;
}
bool check(int ind) {
  if (arr[ind] > 1e5) return 0;
  return 1;
}
int main() {
  long long n, m;
  cin >> n >> m;
  k = sqrt(n);
  for (long long i = 1; i <= n; i++) cin >> arr[i];
  for (long long i = 1; i <= m; i++) {
    cin >> qu[i].l;
    cin >> qu[i].r;
    qu[i].id = i;
  }
  sort(qu, qu + m + 1, cmp);
  for (long long i = 1; i <= m; i++) {
    while (l > qu[i].l) {
      l--;
      if (check(l)) add(l);
    }
    while (r < qu[i].r) {
      r++;
      if (check(r)) add(r);
    }
    while (l < qu[i].l) {
      if (check(l)) rmv(l);
      l++;
    }
    while (r > qu[i].r) {
      if (check(l)) rmv(r);
      r--;
    }
    fin[qu[i].id] = cnt;
  }
  for (long long i = 1; i <= m; i++) cout << fin[i] << endl;
}
