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>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
long long max3(long long x, long long y, long long z) {
  return max(max(x, y), z);
}
long long min3(long long x, long long y, long long z) {
  return min(min(x, y), z);
}
const long long N = 1e5 + 10, M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7,
                inf = 1e17 + 10;
const long long INF = 1e9 + 7;
void add(long long &a, long long b) {
  a += b;
  if (a >= mod) {
    a -= mod;
  }
}
long long X[] = {0, 1, 0, -1};
long long Y[] = {-1, 0, 1, 0};
long long power(long long x, long long n) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = ((x % mod) * (x % mod)) % mod;
    n = n / 2;
  }
  return result;
}
long long n, m;
long long a[N];
long long blocks;
long long b[N];
vector<pair<long long, long long> > query, v;
long long ans;
map<pair<long long, long long>, long long> lol;
bool cmp(pair<long long, long long> &a, pair<long long, long long> &b) {
  if (a.first / blocks == b.first / blocks)
    return a.second < b.second;
  else
    return a.first / blocks < b.first / blocks;
}
void add(long long x) {
  if (x > 1e5) return;
  if (b[x] == x) ans--;
  b[x]++;
  if (b[x] == x) ans++;
}
void rem(long long x) {
  if (x > 1e5) return;
  if (b[x] == x) ans--;
  b[x]--;
  if (b[x] == x) ans++;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  blocks = 300;
  cin >> n >> m;
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (long long i = 0; i < m; i++) {
    long long x, y;
    cin >> x >> y;
    x--;
    y--;
    v.push_back({x, y});
  }
  query = v;
  sort(v.begin(), v.end(), cmp);
  long long l = 0, r = 0;
  for (long long i = 0; i < m; i++) {
    while (l < v[i].first) {
      rem(a[l]);
      l++;
    }
    while (l > v[i].first) {
      add(a[l - 1]);
      l--;
    }
    while (r <= v[i].second) {
      add(a[r]);
      r++;
    }
    while (r > v[i].second + 1) {
      rem(a[r - 1]);
      r--;
    }
    lol[{l, r - 1}] = ans;
  }
  for (long long i = 0; i < m; i++) cout << lol[query[i]] << "\n";
  return 0;
}
