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 mod = 1e9 + 7, inf = 1e9 + 7;
const long long infll = 1e18 + 7;
bool google_contest = false;
long long myadd(long long a, long long b) {
  long long ans = a + b;
  ans -= ans >= mod ? mod : 0;
  return ans;
}
long long mysub(long long a, long long b) { return (a - b + mod) % mod; }
long long mymul(long long a, long long b) { return (a * b) % mod; }
long long mypow(long long a, long long b) {
  long long ans = 1;
  while (b > 0)
    if (b & 1)
      ans = mymul(ans, a), b--;
    else
      a = mymul(a, a), b >>= 1;
  return ans;
}
long long nCr(long long n, long long r) {
  if (r == 0) return 1;
  if (r == 1) return n;
  if (n == 0) return 0;
  return mymul(n, mymul(nCr(n - 1, r - 1), mypow(r, mod - 2)));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t, tt;
  t = 1;
  if (google_contest) tt = 1;
  while (t--) {
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    for (int i = 1; i < n + 1; i++) cin >> a[i];
    map<int, int> mapp;
    for (int i = 1; i < n + 1; i++) {
      mapp[a[i]]++;
    }
    map<int, int> c_array;
    int cnt = 0;
    for (auto i = mapp.begin(); i != mapp.end(); i++) {
      if (i->first <= i->second) {
        c_array[cnt++] = i->first;
      }
    }
    int sz = cnt;
    vector<vector<int> > freq(n + 1, vector<int>(sz, 0));
    for (int i = 0; i < sz; i++) {
      int index = c_array[i];
      for (int j = 1; j < n + 1; j++) {
        if (a[j] == index) freq[j][i]++;
        freq[j][i] += freq[j - 1][i];
      }
    }
    for (int i = 0; i < m; i++) {
      int l, r;
      cin >> l >> r;
      int ans = 0;
      for (int j = 0; j < sz; j++) {
        if (freq[r][j] - freq[l - 1][j] == c_array[j]) ans++;
      }
      cout << ans << '\n';
    }
    if (google_contest) {
      cout << "Case " << tt++ << ": ";
    }
  }
  return 0;
}
