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;
int n, m, arr[200000];
pair<pair<int, int>, int> que[200000];
int result[200000];
int s[200000];
int res;
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / 350 != b.first.first / 350)
    return a.first.first < b.first.first;
  if (a.first.second != b.first.second) return a.first.second < b.first.second;
  return a.first.first < b.first.first;
}
void update(int x, int p) {
  res -= (x == s[x]);
  s[x] += p;
  res += (x == s[x]);
}
int main() {
  cin >> n >> m;
  for (long long int i = 1; i <= n; i++) {
    cin >> arr[i];
    arr[i] = min(arr[i], n + 1);
  }
  for (long long int i = 1; i <= m; i++)
    cin >> que[i].first.first >> que[i].first.second, que[i].second = i;
  sort(que + 1, que + m + 1, cmp);
  int l = 1, r = 0;
  for (long long int i = 1; i <= m; i++) {
    while (que[i].first.second > r) update(arr[++r], +1);
    while (que[i].first.first < l) update(arr[--l], +1);
    while (que[i].first.second < r) update(arr[r--], -1);
    while (que[i].first.first > l) update(arr[l++], -1);
    result[que[i].second] = res;
  }
  for (long long int i = 1; i <= m; i++) cout << result[i] << endl;
}
