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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;

public class B {

    static StreamTokenizer st;
    public static void main(String[] args) throws IOException{
        st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        int n = nextInt();
        int m = nextInt();
        int[]a = new int[n+1];
        for (int i = 1; i <= n; i++) {
            a[i] = nextInt();
        }
        int[]L = new int[m+1], R = new int[m+1], ans = new int[m+1];
        for (int i = 1; i <= m; i++) {
            L[i] = nextInt();
            R[i] = nextInt();
        }
        int[]cnt = new int[n+1];
        for (int i = 1; i <= n; i++) {
            if (a[i] <= n)
                cnt[a[i]]++;
        }
        int[]num = new int[n+1];
        for (int i = 1; i <= n; i++) {
            if (cnt[i] >= i) {
                Arrays.fill(num, 0);
                for (int j = 1; j <= n; j++) {
                    if (a[j]==i)
                        num[j] = 1;
                    num[j] += num[j-1];
                }
                for (int j = 1; j <= m; j++) {
                    if (num[R[j]]-num[L[j]-1]==i)
                        ans[j]++;
                }
            }
        }
        for (int i = 1; i <= m; i++) {
            pw.println(ans[i]);
        }
        pw.close();
    }

    private static int nextInt() throws IOException{
        st.nextToken();
        return (int) st.nval;
    }

}
