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;
template <class T, class first>
inline bool getbit(T a, first i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class first>
inline T setbit(T a, first i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class first>
inline T resetbit(T a, first i) {
  T t = 1;
  return (a & (~(t << i)));
}
template <class T, class first>
inline T togglebit(T a, first i) {
  T t = 1;
  return (a ^ (t << i));
}
template <typename T>
T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return (POW(B, P / 2) * POW(B, P / 2));
}
template <typename T>
T BIGMOD(T b, T p, T m) {
  if (p == 0)
    return 1;
  else if (!(p & 1))
    return (Bigmod(b, p / 2, m) * Bigmod(b, p / 2, m)) % m;
  else
    return ((b % m) * Bigmod(b, p - 1, m)) % m;
}
template <typename T>
T Bigmod(T base, T power, T mod) {
  T ret = 1;
  while (power) {
    if (power & 1) ret = (ret * base) % mod;
    base = (base * base) % mod;
    power >>= 1;
  }
  return ret;
}
template <typename T>
T ModInverse(T number, T mod) {
  return Bigmod(number, mod - 2, mod);
}
template <typename T>
T GCD(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
T LCM(T a, T b) {
  if (a < 0) return lcm(-a, b);
  if (b < 0) return lcm(a, -b);
  return a * (b / gcd(a, b));
}
template <typename T>
T EUCLIDE(T a, T b, T &x, T &y) {
  if (a < 0) {
    T d = euclide(-a, b, x, y);
    x = -x;
    return d;
  }
  if (b < 0) {
    T d = euclide(a, -b, x, y);
    y = -y;
    return d;
  }
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    T d = euclide(b, a % b, x, y);
    T t = x;
    x = y;
    y = t - (a / b) * y;
    return d;
  }
}
template <typename T>
T ABS(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
double DEG(double x) { return (180.0 * x) / ((2.0 * acos(0.0))); }
double RAD(double x) { return (x * (double)(2.0 * acos(0.0))) / (180.0); }
template <typename T>
T DIS(T x1, T y1, T x2, T y2) {
  return sqrt((double)((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
}
template <typename T>
T ANGLE(T x1, T y1, T x2, T y2) {
  return atan(double(y1 - y2) / double(x1 - x2));
}
template <typename T>
long long isLeft(T a, T b, T c) {
  return (c.x - a.x) * (b.y - a.y) - (b.x - a.x) * (c.y - a.y);
}
void P_ARR(int *ar, int a, int b) {
  if (a > b) swap(a, b);
  if (a <= b) cout << ar[a];
  for (int i = a + 1; i <= b; i++) cout << " " << ar[i];
  cout << endl;
}
int sq;
struct data {
  int id;
  int l, r;
  bool operator<(const data &p) const {
    return (((l / sq) < (p.l / sq)) || ((l / sq) == (p.l / sq) && (r < p.r)));
  }
} qq[100007];
int ar[100007];
int br[100007];
int cnt[100007];
int res[100007];
int main() {
  sq = 1000;
  int(n);
  scanf("%d", &n);
  int(q);
  scanf("%d", &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &(ar[i]));
    if (ar[i] > 100007) ar[i] = 100007 - 3;
  }
  for (int i = 1; i <= q; i++) {
    scanf("%d%d", &(qq[i].l), &(qq[i].r));
    qq[i].id = i;
  }
  sort(qq + 1, qq + 1 + q);
  int l = qq[1].l;
  int r = l - 1;
  int ans = 0;
  for (int i = 1; i <= q; i++) {
    while (l < qq[i].l) {
      cnt[ar[l]]--;
      if (cnt[ar[l]] == ar[l]) ans++;
      if (cnt[ar[l]] + 1 == ar[l]) ans--;
      l++;
    }
    while (r < qq[i].r) {
      r++;
      cnt[ar[r]]++;
      if (cnt[ar[r]] == ar[r]) ans++;
      if (cnt[ar[r]] - 1 == ar[r]) ans--;
    }
    while (l > qq[i].l) {
      l--;
      cnt[ar[l]]++;
      if (cnt[ar[l]] == ar[l]) ans++;
      if (cnt[ar[l]] - 1 == ar[l]) ans--;
    }
    while (r > qq[i].r) {
      cnt[ar[r]]--;
      if (cnt[ar[r]] == ar[r]) ans++;
      if (cnt[ar[r]] + 1 == ar[r]) ans--;
      r--;
    }
    res[qq[i].id] = ans;
  }
  for (int i = 1; i <= q; i++) {
    printf("%d\n", res[i]);
  }
  return 0;
}
