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;
int n, a[N], queries;
const int K = 320;
int cnt_big[N / K + 2][N], cnt_small[K + 1][N], occur[N];
vector<int> val, big;
bool avail[N];
int get_compress(int x) {
  return lower_bound(val.begin(), val.end(), x) - val.begin();
}
void Compress() {
  val = vector<int>(a, a + n);
  sort(val.begin(), val.end());
  val.resize(unique(val.begin(), val.end()) - val.begin());
  for (int i = 0; i < n; ++i) {
    ++occur[get_compress(a[i])];
  }
}
int Countt(int a[], int l, int r) { return a[r] - (l > 0 ? a[l - 1] : 0); }
void Answer() {
  for (int i = 1; i <= queries; ++i) {
    int l, r;
    int ans = 0;
    scanf("%d%d", &l, &r);
    --l, --r;
    for (int i = 1; i < K; ++i) {
      if (Countt(cnt_small[i], l, r) == i) {
        ++ans;
      }
    }
    for (size_t i = 0; i < big.size(); ++i) {
      if (Countt(cnt_big[i], l, r) == big[i]) {
        ++ans;
      }
    }
    printf("%d\n", ans);
  }
}
int main() {
  scanf("%d%d", &n, &queries);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n; ++i) {
    if (a[i] < K) {
      ++cnt_small[a[i]][i];
    }
  }
  for (int i = 0; i < K; ++i) {
    partial_sum(cnt_small[i], cnt_small[i] + n, cnt_small[i]);
  }
  Compress();
  for (int i = 0; i < n; ++i) {
    int q = get_compress(a[i]);
    if (a[i] >= K && occur[q] >= K && !avail[q]) {
      int p = big.size();
      big.push_back(a[i]);
      avail[q] = true;
      for (int j = 0; j < n; ++j) {
        cnt_big[p][j] = (j > 0 ? cnt_big[p][j - 1] : 0) + (a[i] == a[j]);
      }
    }
  }
  Answer();
  return 0;
}
