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.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.TreeMap;

public class d {
    int maxn = 100010;
    StreamTokenizer in = new StreamTokenizer(new BufferedReader(
            new InputStreamReader(System.in)));
    int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }
    int arr[] = new int[maxn],num[] = new int[maxn], sum[] = new int[maxn];
    int left[] = new int[maxn], right[] = new int[maxn], ans[] = new int[maxn];
    void run() throws IOException {
        int n = nextInt();
        int m = nextInt();
        for (int i = 1; i <= n; i++) {
            arr[i] = nextInt();
            if (arr[i] > n)
                arr[i] = 0;
            num[arr[i]]++;
        }
        for (int i = 1; i <= m; i++) {
            left[i] = nextInt();
            right[i] = nextInt();
        }
        for (int i = 1; i <= n; i++)
            if (arr[i] != 0 && num[arr[i]] >= arr[i]) {
                num[arr[i]] = 0;
                for (int j = 1; j <= n; j++) {
                    sum[j]=sum[j-1];
                    if(arr[j]==arr[i])
                        sum[j]++;
                }
                for(int j=1;j<=m;j++)
                    if(sum[right[j]]-sum[left[j]-1]==arr[i])
                        ans[j]++;
            }
        for(int i=1;i<=m;i++)
            System.out.println(ans[i]);
    }

    public static void main(String[] args) throws IOException {
        new d().run();
    }
}
