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
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Collections;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ProblemBLittleElephantAndArray solver = new ProblemBLittleElephantAndArray();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemBLittleElephantAndArray {
        int sqrt;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            sqrt = (int) (Math.sqrt(n) + 1);
            int[] a = new int[n];
            int[] f = new int[n + 1];
            for (int i = 0; i < n; ++i) a[i] = in.nextInt();
            ArrayList<Query> queries = new ArrayList<>(m);
            for (int i = 0; i < m; ++i) queries.add(new Query(in.nextInt() - 1, in.nextInt() - 1, i));
            Collections.sort(queries);
            int[] ans = new int[m];
            int l = 0, r = 0, cnt = a[l] == 1 ? 1 : 0;
            if (a[l] <= n) f[a[l]]++;
            for (Query q : queries) {
                while (l > q.l) {
                    --l;
                    if (a[l] <= n) {
                        if (f[a[l]] == a[l]) --cnt;
                        f[a[l]]++;
                        if (f[a[l]] == a[l]) ++cnt;
                    }
                }
                while (l < q.l) {
                    if (a[l] <= n) {
                        if (f[a[l]] == a[l]) --cnt;
                        f[a[l]]--;
                        if (f[a[l]] == a[l]) ++cnt;
                    }
                    ++l;
                }
                while (r > q.r) {
                    if (a[r] <= n) {
                        if (f[a[r]] == a[r]) --cnt;
                        f[a[r]]--;
                        if (f[a[r]] == a[r]) ++cnt;
                    }
                    --r;
                }
                while (r < q.r) {
                    ++r;
                    if (a[r] <= n) {
                        if (f[a[r]] == a[r]) --cnt;
                        f[a[r]]++;
                        if (f[a[r]] == a[r]) ++cnt;
                    }
                }
                ans[q.index] = cnt;
            }
            for (int i = 0; i < m; ++i) out.println(ans[i]);
        }

        class Query implements Comparable<Query> {
            int l;
            int r;
            int index;

            Query(int ll, int rr, int i) {
                l = ll;
                r = rr;
                index = i;
            }

            public int compareTo(Query o) {
                if (l / sqrt == o.l / sqrt) return r - o.r;
                return l / sqrt - o.l / sqrt;
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

