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.util.Arrays;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author FinnTheHuman
 */
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);
        SqrtDecompFreqCount solver = new SqrtDecompFreqCount();
        solver.solve(1, in, out);
        out.close();
    }

    static class SqrtDecompFreqCount {
        int total;
        int[] v;
        Query[] queries;
        HashMap<Integer, Integer> freqMap = new HashMap<>();

        int apprSqrt(int x) {
            int ret = 0;
            while (ret * ret <= x) ++ret;
            return ret;
        }

        void remove(int pos) {
            int newVal = freqMap.get(v[pos]) - 1;
            if (newVal == v[pos]) ++total;
            if (newVal == v[pos] - 1) --total;
            freqMap.put(v[pos], newVal);
        }

        void add(int pos) {
            int newVal = freqMap.get(v[pos]) + 1;
            if (newVal == v[pos]) ++total;
            if (newVal == v[pos] + 1) --total;
            freqMap.put(v[pos], newVal);
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int sqn = apprSqrt(n);
            int m = in.nextInt();
            v = new int[n];
            queries = new Query[m];
            Query[] originalQueries = new Query[m];
            for (int i = 0; i < n; ++i) {
                v[i] = in.nextInt();
                freqMap.put(v[i], 0);
            }
            for (int i = 0; i < m; ++i) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                queries[i] = new Query(l, r, l / sqn);
                originalQueries[i] = queries[i];
            }
            Arrays.sort(queries, new CompareByOrder());
            int l = 0, r = 0;
            total = 0;
            add(0);
            for (Query q : queries) {
                for (int i = l; i < q.l; ++i) {
                    remove(i);
                }
                for (int i = q.l; i < l; ++i) {
                    add(i);
                }
                for (int i = q.r + 1; i <= r; ++i) {
                    remove(i);
                }
                for (int i = r + 1; i <= q.r; ++i) {
                    add(i);
                }
                l = q.l;
                r = q.r;
                q.answer = total;
            }
            for (Query q : originalQueries) {
                out.print(q.answer + "\n");
            }
        }

        class CompareByOrder implements Comparator<Query> {
            public int compare(Query a, Query b) {
                if (a.bucket != b.bucket) {
                    return a.bucket < b.bucket ? -1 : 1;
                }
                if (a.r != b.r) {
                    return a.r < b.r ? -1 : 1;
                }
                return 0;
            }

        }

        class Query {
            int l;
            int r;
            int bucket;
            int answer;

            public Query(int l, int r, int bucket) {
                this.l = l;
                this.r = r;
                this.bucket = bucket;
            }

        }

    }

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

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 65536 / 2);
            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());
        }

    }
}

