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;
using ll = long long;
using pii = pair<int, int>;
const int INF32 = INT_MAX;
const ll INF64 = ((ll)INF32 << 29ll);
void reflex() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
}
const int N = 1e5 + 1e2;
struct Query {
  int l, r, id;
} q[N];
int n;
int f(int x) { return x / sqrt(n); }
bool cmp(Query x, Query y) {
  if (f(x.l) != f(y.l)) return f(x.l) < f(y.l);
  return x.r < y.r;
}
signed main() {
  reflex();
  int t;
  cin >> n >> t;
  vector<int> a(n);
  for (int& x : a) cin >> x;
  for (int i = 0, l, r; i < t; i++) {
    cin >> l >> r;
    l--, r--;
    q[i].l = l;
    q[i].r = r;
    q[i].id = i;
  }
  sort(q, q + t, cmp);
  unordered_map<int, int> cnt;
  int res = 0;
  auto add = [&](int x) {
    x = a[x];
    cnt[x]++;
    if (cnt[x] == x) res++;
    if (cnt[x] - 1 == x) res--;
  };
  auto del = [&](int x) {
    x = a[x];
    cnt[x]--;
    if (cnt[x] == x) res++;
    if (cnt[x] + 1 == x) res--;
  };
  int curl = q[0].l;
  int curr = curl;
  add(curl);
  vector<int> ans(t);
  for (int i = 0; i < t; i++) {
    int l = q[i].l;
    int r = q[i].r;
    int id = q[i].id;
    while (curl < l) del(curl++);
    while (curl > l) add(--curl);
    while (curr < r) add(++curr);
    while (curr > r) del(curr--);
    ans[id] = res;
  }
  for (int x : ans) cout << x << "\n";
  return false;
}
