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.*;
import java.util.*;

public class Main {
    static PrintWriter out = new PrintWriter(new BufferedWriter(
            new OutputStreamWriter(System.out)));

    public static void main(String[] args) throws IOException {
        // PrintStream out = new PrintStream(new
        // FileOutputStream("out.out"));
        Scan scan = new Scan();
        int n = scan.nextInt();
        int m = scan.nextInt();
        int a[] = new int[n + 1];
        int b[] = new int[n + 1];
        int l[] = new int[m+1];
        int r[] = new int[m+1];
        int ans[] = new int[m+1];
        for (int i = 1; i <= n; i++) {
            a[i] = scan.nextInt();
            if (a[i] <= n)
                b[a[i]]++;
        }
        for(int i = 1;i<=m;i++){
            l[i] = scan.nextInt();
            r[i] = scan.nextInt();
        }
        for (int i = 1; i <= n; i++) {
            if (b[i] >= i) {
                int tmp[] = new int [n+1];
                for(int j=1; j<=n; j++)
                {
                    tmp[j] = tmp[j-1];
                    if( a[j] == i )
                        tmp[j]++;
                }
                for(int j=1; j<=m; j++)
                    if( tmp[r[j]]-tmp[l[j]-1] == i)
                        ans[j]++;
            }
        }
        for(int i = 1;i<=m;i++){
            out.println(ans[i]);
        }
        out.flush();
    }
}

class Scan {

    BufferedReader buffer;
    StringTokenizer tok;

    Scan() {
        buffer = new BufferedReader(new InputStreamReader(System.in));
        // FileReader filereader=null;
        // try {
        // filereader = new FileReader("in.in");
        // } catch (FileNotFoundException e) {
        // // TODO Auto-generated catch block
        // e.printStackTrace();
        // }
        // buffer = new BufferedReader(filereader);
    }

    boolean hasNext() {
        while (tok == null || !tok.hasMoreElements()) {
            try {
                tok = new StringTokenizer(buffer.readLine());
            } catch (Exception e) {
                return false;
            }
        }
        return true;
    }

    String next() {
        if (hasNext())
            return tok.nextToken();
        return null;
    }

    String nextLine() {
        String s = null;
        try {
            s = buffer.readLine();
        } catch (Exception e) {
            return null;
        }
        return s;
    }

    char nextChar() {
        try {
            return ((char) buffer.read());
        } catch (Exception e) {
        }
        return '\0';
    }

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

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }
}
