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 + 5;
const int BLOCK = 300;
int ar[N];
int ans[N];
int cek[N];
int n;
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  int blocka = a.first.first / BLOCK;
  int blockb = b.first.first / BLOCK;
  if (blocka == blockb) return a.first.second < b.first.second;
  return blocka < blockb;
}
void add(int x, int &cnt) {
  if (ar[x] > n) return;
  if (cek[ar[x]] == ar[x]) cnt--;
  cek[ar[x]]++;
  if (cek[ar[x]] == ar[x]) cnt++;
  return;
}
void del(int x, int &cnt) {
  if (ar[x] > n) return;
  if (cek[ar[x]] == ar[x]) cnt--;
  cek[ar[x]]--;
  if (cek[ar[x]] == ar[x]) cnt++;
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(cek, 0, sizeof cek);
  int m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> ar[i];
  vector<pair<pair<int, int>, int> > lst;
  for (int i = 1; i <= m; i++) {
    int l, r;
    cin >> l >> r;
    lst.push_back(make_pair(make_pair(l, r), i));
  }
  sort(lst.begin(), lst.end(), cmp);
  int cnt = 0;
  int l = 0, r = -1;
  for (int i = 0; i < lst.size(); i++) {
    int curl = lst[i].first.first;
    int curr = lst[i].first.second;
    while (r < curr) add(++r, cnt);
    while (r > curr) del(r--, cnt);
    while (l < curl) del(l++, cnt);
    while (l > curl) add(--l, cnt);
    ans[lst[i].second] = cnt;
  }
  for (int i = 1; i <= m; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
