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 Main implements Runnable {
		
	public void solve() throws IOException {
		int N = nextInt(); int M = nextInt();
                
                int[] a = new int[N]; 
                for(int i = 0; i < N; i++) a[i] = nextInt();
                
                int[] cnt = new int[N + 1];
                for(int i = 0; i < N; i++) if(a[i] <= N) cnt[a[i]]++;
                
                int[] ql = new int[M];
                int[] qr = new int[M];
                for(int i = 0; i < M; i++){
                    ql[i] = nextInt() - 1;
                    qr[i] = nextInt() - 1;
                }
                
                int[] answer = new int[M];
                for(int x = 1; x <= N; x++){
                    if(cnt[x] < x) continue;
                    
                    int[] sum = new int[N + 1];
                    for(int i = 1; i <= N; i++){
                        sum[i] += a[i - 1] == x ? (1 + sum[i - 1]) : (sum[i - 1]);
                    }
                    
                    for(int i = 0; i < M; i++){
                        if(sum[qr[i] + 1] - sum[ql[i]] == x) answer[i]++;
                    }
                }
                
                StringBuilder pr = new StringBuilder();
                for(int i = 0; i < M; i++) pr.append(answer[i] + "\n");
                
                System.out.print(pr.toString());
	}

	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	//-----------------------------------------------------------
	public static void main(String[] args) {
		new Main().run();
	}

        public void print1Int(int[] a){
                for(int i = 0; i < a.length; i++)
                        System.out.print(a[i] + " ");
                System.out.println();
        }
        
        public void print2Int(int[][] a){
                for(int i = 0; i < a.length; i++){
                        for(int j = 0; j < a[0].length; j++){
                                System.out.print(a[i][j] + " ");
                        }
                        System.out.println();
                }
        }
        
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			tok = null;
			solve();
			in.close();
		} catch (IOException e) {
			System.exit(0);
		}
	}

	public String nextToken() throws IOException {
		while (tok == null || !tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	public long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	public double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	BufferedReader in;
	StringTokenizer tok;
}