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 double PI = acos(-1);
const long long mod = 1e9 + 7;
const int INF = 2e9;
const int MAX = 505, N = 1e6 + 10;
int n, q;
vector<int> v, cnt;
void add(int pos, int &ans) {
  if (v[pos] <= n && cnt[v[pos]] == v[pos]) ans--;
  if (v[pos] <= n) cnt[v[pos]]++;
  if (v[pos] <= n && cnt[v[pos]] == v[pos]) ans++;
}
void rmv(int pos, int &ans) {
  if (v[pos] <= n && cnt[v[pos]] == v[pos]) ans--;
  if (v[pos] <= n) cnt[v[pos]]--;
  if (v[pos] <= n && cnt[v[pos]] == v[pos]) ans++;
}
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.second < b.first.second) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> q;
  v.resize(n);
  cnt.resize(n + 5);
  for (int i = 0; i < n; i++) cin >> v[i];
  vector<pair<pair<int, int>, int>> qur(q), tmp;
  for (int i = 0; i < q; i++) {
    cin >> qur[i].first.first >> qur[i].first.second;
    qur[i].first.first--;
    qur[i].first.second--;
    qur[i].second = i;
  }
  tmp = qur;
  sort(qur.begin(), qur.end());
  int buc = sqrt(n) + 1;
  int sz = (n + buc - 1) / buc;
  int b = 0;
  vector<vector<pair<pair<int, int>, int>>> sqd(sz);
  for (int i = 0; i < q; i++) {
    if (qur[i].first.first < (b + 1) * buc)
      sqd[b].push_back(qur[i]);
    else
      sqd[++b].push_back(qur[i]);
  }
  for (int i = 0; i < sqd.size(); i++) sort(sqd[i].begin(), sqd[i].end(), cmp);
  vector<int> res(q);
  int moL = 0, moR = -1, ans = 0;
  for (int i = 0; i < sqd.size(); i++) {
    for (int j = 0; j < sqd[i].size(); j++) {
      int l = sqd[i][j].first.first, r = sqd[i][j].first.second;
      while (moL < l) {
        rmv(moL, ans);
        moL++;
      }
      while (moL > l) {
        moL--;
        add(moL, ans);
      }
      while (moR < r) {
        moR++;
        add(moR, ans);
      }
      while (moR > r) {
        rmv(moR, ans);
        moR--;
      }
      res[sqd[i][j].second] = ans;
    }
  }
  for (int i = 0; i < q; i++) cout << res[i] << "\n";
  return 0;
}
