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.util.*;
import java.io.*;
public class B202{

    public void run(){
        
        Scanner reader = new Scanner(System.in);
        int n = reader.nextInt();
        int m = reader.nextInt();
        int a[] = new int [n+1];
        int sum[] = new int[n+1];
        for(int i = 1 ; i <= n  ;i ++){
            a[i] = reader.nextInt();
            if(a[i] <= n) sum[a[i]] ++;
        }
        TreeMap<Integer ,Integer> map = new TreeMap<Integer,Integer>();
        int cnt = 1;
        for(int i =1 ; i <= n ; i ++){
            if(sum[i] >= i){
                map.put(i,cnt++);
            }
        }
        Set<Integer> set = map.keySet();
        int l[] = new int [m+1];
        int r[] = new int[m+1];
        for(int i = 1; i  <= m ; i ++){
            l[i] = reader.nextInt() - 1;
            r[i] = reader.nextInt();
        }
        int ans[] = new int[m+1];
        for(Integer i  : set){
            int d[] = new int[n+1];
            for(int j = 1 ; j <= n ; j ++){
                int tmp = 0;
                if(a[j] == i) tmp = 1;
                d[j] = d[j-1]+tmp;
            }
            for(int j = 1 ; j <= m ; j ++){
                if(d[r[j]] - d[l[j]] == i)
                    ans[j] ++;
            }
        }
        for(int i = 1 ; i <= m ; i ++){
            System.out.println(ans[i]);
        }
        /*
        while(m > 0){
            m --;
            int x = reader.nextInt();
            int y = reader.nextInt();
            int ans = 0;
            for(int i = 1 ; i < cnt ; i ++){
                if(d[i][y] - d[i][x-1] == i) ans ++;
            }
            System.out.println(ans);
        }
        */
    }
    public static void main(String args[]){
        new B202().run();
    }
}